TSTP Solution File: GEO082+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO082+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n012.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 : Sat Jul 16 04:03:27 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 5 unt; 0 def)
% Number of atoms : 52 ( 11 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 49 ( 16 ~; 20 |; 7 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 28 ( 2 sgn 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(part_of_antisymmetry,conjecture,
! [X2,X4] :
( ( part_of(X2,X4)
& part_of(X4,X2) )
=> X2 = X4 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',part_of_antisymmetry) ).
fof(part_of_defn,axiom,
! [X1,X2] :
( part_of(X2,X1)
<=> ! [X3] :
( incident_c(X3,X2)
=> incident_c(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+0.ax',part_of_defn) ).
fof(c9,axiom,
! [X1,X2] :
( ! [X3] :
( incident_c(X3,X1)
<=> incident_c(X3,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+0.ax',c9) ).
fof(c_0_3,negated_conjecture,
~ ! [X2,X4] :
( ( part_of(X2,X4)
& part_of(X4,X2) )
=> X2 = X4 ),
inference(assume_negation,[status(cth)],[part_of_antisymmetry]) ).
fof(c_0_4,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ part_of(X5,X4)
| ~ incident_c(X6,X5)
| incident_c(X6,X4) )
& ( incident_c(esk3_2(X4,X5),X5)
| part_of(X5,X4) )
& ( ~ incident_c(esk3_2(X4,X5),X4)
| part_of(X5,X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[part_of_defn])])])])])])]) ).
fof(c_0_5,negated_conjecture,
( part_of(esk1_0,esk2_0)
& part_of(esk2_0,esk1_0)
& esk1_0 != esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( incident_c(X1,X2)
| ~ incident_c(X1,X3)
| ~ part_of(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
part_of(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X4,X5] :
( ( ~ incident_c(esk6_2(X4,X5),X4)
| ~ incident_c(esk6_2(X4,X5),X5)
| X4 = X5 )
& ( incident_c(esk6_2(X4,X5),X4)
| incident_c(esk6_2(X4,X5),X5)
| X4 = X5 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c9])])])])])]) ).
cnf(c_0_9,negated_conjecture,
part_of(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( incident_c(X1,esk2_0)
| ~ incident_c(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
( X1 = X2
| incident_c(esk6_2(X1,X2),X2)
| incident_c(esk6_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( X1 = X2
| ~ incident_c(esk6_2(X1,X2),X2)
| ~ incident_c(esk6_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( incident_c(X1,esk1_0)
| ~ incident_c(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( X1 = esk1_0
| incident_c(esk6_2(X1,esk1_0),esk2_0)
| incident_c(esk6_2(X1,esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
( X1 = esk1_0
| ~ incident_c(esk6_2(X1,esk1_0),esk2_0)
| ~ incident_c(esk6_2(X1,esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
incident_c(esk6_2(esk2_0,esk1_0),esk2_0),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_14]),c_0_15]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_17])]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GEO082+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jun 17 21:27:23 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.015 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 19
% 0.24/1.42 # Proof object clause steps : 12
% 0.24/1.42 # Proof object formula steps : 7
% 0.24/1.42 # Proof object conjectures : 12
% 0.24/1.42 # Proof object clause conjectures : 9
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 6
% 0.24/1.42 # Proof object initial formulas used : 3
% 0.24/1.42 # Proof object generating inferences : 6
% 0.24/1.42 # Proof object simplifying inferences : 4
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 17
% 0.24/1.42 # Removed by relevancy pruning/SinE : 10
% 0.24/1.42 # Initial clauses : 20
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 20
% 0.24/1.42 # Processed clauses : 31
% 0.24/1.42 # ...of these trivial : 0
% 0.24/1.42 # ...subsumed : 0
% 0.24/1.42 # ...remaining for further processing : 31
% 0.24/1.42 # Other redundant clauses eliminated : 0
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 0
% 0.24/1.42 # Generated clauses : 33
% 0.24/1.42 # ...of the previous two non-trivial : 22
% 0.24/1.42 # Contextual simplify-reflections : 0
% 0.24/1.42 # Paramodulations : 29
% 0.24/1.42 # Factorizations : 4
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 31
% 0.24/1.42 # Positive orientable unit clauses : 4
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 1
% 0.24/1.42 # Non-unit-clauses : 26
% 0.24/1.42 # Current number of unprocessed clauses: 11
% 0.24/1.42 # ...number of literals in the above : 56
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 0
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 152
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 40
% 0.24/1.42 # Non-unit clause-clause subsumptions : 0
% 0.24/1.42 # Unit Clause-clause subsumption calls : 6
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 17
% 0.24/1.42 # BW rewrite match successes : 0
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 2061
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.015 s
% 0.24/1.42 # System time : 0.003 s
% 0.24/1.42 # Total time : 0.018 s
% 0.24/1.42 # Maximum resident set size: 2828 pages
%------------------------------------------------------------------------------