TSTP Solution File: PUZ132+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PUZ132+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.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 : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 18:10:53 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% 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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',washington_conjecture) ).
fof(beautiful_capital_axiom,axiom,
! [X2] :
( country(X2)
=> beautiful(capital_city(X2)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',beautiful_capital_axiom) ).
fof(usa_capital_axiom,axiom,
capital_city(usa) = washington,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',usa_capital_axiom) ).
fof(usa_type,axiom,
country(usa),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',usa_type) ).
fof(crime_axiom,axiom,
! [X2] :
( city(X2)
=> has_crime(X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',crime_axiom) ).
fof(capital_city_type,axiom,
! [X1] :
( capital(X1)
=> city(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',capital_city_type) ).
fof(washington_type,axiom,
capital(washington),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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,
! [X3] :
( ~ country(X3)
| beautiful(capital_city(X3)) ),
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,
( ~ has_crime(washington)
| ~ beautiful(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,
! [X2] :
( ~ capital(X2)
| city(X2) ),
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.00/0.12 % Problem : PUZ132+1 : TPTP v8.1.0. Released v4.1.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n026.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 : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun May 29 02:30:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.013 s
% 0.23/1.41
% 0.23/1.41 # Failure: Out of unprocessed clauses!
% 0.23/1.41 # OLD status GaveUp
% 0.23/1.41 # Parsed axioms : 11
% 0.23/1.41 # Removed by relevancy pruning/SinE : 2
% 0.23/1.41 # Initial clauses : 9
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 9
% 0.23/1.41 # Processed clauses : 9
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 0
% 0.23/1.41 # ...remaining for further processing : 9
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 0
% 0.23/1.41 # Generated clauses : 0
% 0.23/1.41 # ...of the previous two non-trivial : 0
% 0.23/1.41 # Contextual simplify-reflections : 0
% 0.23/1.41 # Paramodulations : 0
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 9
% 0.23/1.41 # Positive orientable unit clauses : 4
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 0
% 0.23/1.41 # Non-unit-clauses : 5
% 0.23/1.41 # Current number of unprocessed clauses: 0
% 0.23/1.41 # ...number of literals in the above : 0
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 0
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 0
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 0
% 0.23/1.41 # Non-unit clause-clause subsumptions : 0
% 0.23/1.41 # Unit Clause-clause subsumption calls : 0
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 0
% 0.23/1.41 # BW rewrite match successes : 0
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 316
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.011 s
% 0.23/1.41 # System time : 0.002 s
% 0.23/1.41 # Total time : 0.014 s
% 0.23/1.41 # Maximum resident set size: 2768 pages
% 0.23/1.41 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.41 # Preprocessing time : 0.013 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 23
% 0.23/1.41 # Proof object clause steps : 11
% 0.23/1.41 # Proof object formula steps : 12
% 0.23/1.41 # Proof object conjectures : 7
% 0.23/1.41 # Proof object clause conjectures : 4
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 7
% 0.23/1.41 # Proof object initial formulas used : 7
% 0.23/1.41 # Proof object generating inferences : 3
% 0.23/1.41 # Proof object simplifying inferences : 6
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 11
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 11
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 11
% 0.23/1.41 # Processed clauses : 14
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 0
% 0.23/1.41 # ...remaining for further processing : 14
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 1
% 0.23/1.41 # Generated clauses : 4
% 0.23/1.41 # ...of the previous two non-trivial : 3
% 0.23/1.41 # Contextual simplify-reflections : 0
% 0.23/1.41 # Paramodulations : 4
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 13
% 0.23/1.41 # Positive orientable unit clauses : 7
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 2
% 0.23/1.41 # Non-unit-clauses : 4
% 0.23/1.41 # Current number of unprocessed clauses: 0
% 0.23/1.41 # ...number of literals in the above : 0
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 1
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 0
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 0
% 0.23/1.41 # Non-unit clause-clause subsumptions : 0
% 0.23/1.41 # Unit Clause-clause subsumption calls : 0
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 1
% 0.23/1.41 # BW rewrite match successes : 1
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 356
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.012 s
% 0.23/1.41 # System time : 0.001 s
% 0.23/1.41 # Total time : 0.013 s
% 0.23/1.41 # Maximum resident set size: 2776 pages
%------------------------------------------------------------------------------