TSTP Solution File: PUZ132+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : PUZ132+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:13:07 EDT 2023
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 23 ( 10 unt; 0 def)
% Number of atoms : 36 ( 2 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 26 ( 13 ~; 8 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 9 ( 0 sgn; 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(washington_conjecture,conjecture,
( beautiful(washington)
& has_crime(washington) ),
file('/export/starexec/sandbox/tmp/tmp.vXGSKmiAMN/E---3.1_31784.p',washington_conjecture) ).
fof(beautiful_capital_axiom,axiom,
! [X2] :
( country(X2)
=> beautiful(capital_city(X2)) ),
file('/export/starexec/sandbox/tmp/tmp.vXGSKmiAMN/E---3.1_31784.p',beautiful_capital_axiom) ).
fof(usa_capital_axiom,axiom,
capital_city(usa) = washington,
file('/export/starexec/sandbox/tmp/tmp.vXGSKmiAMN/E---3.1_31784.p',usa_capital_axiom) ).
fof(usa_type,axiom,
country(usa),
file('/export/starexec/sandbox/tmp/tmp.vXGSKmiAMN/E---3.1_31784.p',usa_type) ).
fof(crime_axiom,axiom,
! [X2] :
( city(X2)
=> has_crime(X2) ),
file('/export/starexec/sandbox/tmp/tmp.vXGSKmiAMN/E---3.1_31784.p',crime_axiom) ).
fof(capital_city_type,axiom,
! [X1] :
( capital(X1)
=> city(X1) ),
file('/export/starexec/sandbox/tmp/tmp.vXGSKmiAMN/E---3.1_31784.p',capital_city_type) ).
fof(washington_type,axiom,
capital(washington),
file('/export/starexec/sandbox/tmp/tmp.vXGSKmiAMN/E---3.1_31784.p',washington_type) ).
fof(c_0_7,negated_conjecture,
~ ( beautiful(washington)
& has_crime(washington) ),
inference(assume_negation,[status(cth)],[washington_conjecture]) ).
fof(c_0_8,plain,
! [X4] :
( ~ country(X4)
| beautiful(capital_city(X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[beautiful_capital_axiom])]) ).
fof(c_0_9,negated_conjecture,
( ~ beautiful(washington)
| ~ has_crime(washington) ),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( beautiful(capital_city(X1))
| ~ country(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
capital_city(usa) = washington,
inference(split_conjunct,[status(thm)],[usa_capital_axiom]) ).
cnf(c_0_12,plain,
country(usa),
inference(split_conjunct,[status(thm)],[usa_type]) ).
cnf(c_0_13,negated_conjecture,
( ~ beautiful(washington)
| ~ has_crime(washington) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
beautiful(washington),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
fof(c_0_15,plain,
! [X3] :
( ~ city(X3)
| has_crime(X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[crime_axiom])]) ).
cnf(c_0_16,negated_conjecture,
~ has_crime(washington),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_17,plain,
( has_crime(X1)
| ~ city(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X6] :
( ~ capital(X6)
| city(X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[capital_city_type])]) ).
cnf(c_0_19,negated_conjecture,
~ city(washington),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( city(X1)
| ~ capital(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
capital(washington),
inference(split_conjunct,[status(thm)],[washington_type]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PUZ132+1 : TPTP v8.1.2. Released v4.1.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 2400
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Oct 2 18:56:44 EDT 2023
% 0.12/0.35 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.vXGSKmiAMN/E---3.1_31784.p
% 0.19/0.49 # Version: 3.1pre001
% 0.19/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # sh5l with pid 31864 completed with status 0
% 0.19/0.49 # Result found by sh5l
% 0.19/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.49 # Search class: FHHSF-FFSM11-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.49 # SAT001_MinMin_p005000_rr_RG with pid 31865 completed with status 0
% 0.19/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.49 # Search class: FHHSF-FFSM11-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Theorem
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 11
% 0.19/0.49 # Removed by relevancy pruning/SinE : 0
% 0.19/0.49 # Initial clauses : 11
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 11
% 0.19/0.49 # Processed clauses : 25
% 0.19/0.49 # ...of these trivial : 0
% 0.19/0.49 # ...subsumed : 0
% 0.19/0.49 # ...remaining for further processing : 25
% 0.19/0.49 # Other redundant clauses eliminated : 0
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 0
% 0.19/0.49 # Backward-rewritten : 1
% 0.19/0.49 # Generated clauses : 4
% 0.19/0.49 # ...of the previous two non-redundant : 3
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 0
% 0.19/0.49 # Paramodulations : 4
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 0
% 0.19/0.49 # Total rewrite steps : 5
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 13
% 0.19/0.49 # Positive orientable unit clauses : 7
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 2
% 0.19/0.49 # Non-unit-clauses : 4
% 0.19/0.49 # Current number of unprocessed clauses: 0
% 0.19/0.49 # ...number of literals in the above : 0
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 12
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.49 # Non-unit clause-clause subsumptions : 0
% 0.19/0.49 # Unit Clause-clause subsumption calls : 1
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 1
% 0.19/0.49 # BW rewrite match successes : 1
% 0.19/0.49 # Condensation attempts : 0
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 370
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.003 s
% 0.19/0.49 # System time : 0.001 s
% 0.19/0.49 # Total time : 0.004 s
% 0.19/0.49 # Maximum resident set size: 1756 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.004 s
% 0.19/0.49 # System time : 0.003 s
% 0.19/0.49 # Total time : 0.007 s
% 0.19/0.49 # Maximum resident set size: 1676 pages
% 0.19/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------