TSTP Solution File: GEO265+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO265+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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:05:12 EDT 2022
% Result : Theorem 0.16s 1.35s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 5 unt; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 32 ( 14 ~; 9 |; 4 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 28 ( 6 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X4,X5] :
( equally_directed_lines(X4,reverse_line(X5))
=> equally_directed_opposite_lines(X4,X5) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',con) ).
fof(a5_defns,axiom,
! [X1,X2] :
( equally_directed_opposite_lines(X1,X2)
<=> ~ unequally_directed_opposite_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',a5_defns) ).
fof(a1_defns,axiom,
! [X1,X2] :
( unequally_directed_opposite_lines(X1,X2)
<=> unequally_directed_lines(X1,reverse_line(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',a1_defns) ).
fof(a4_defns,axiom,
! [X1,X2] :
( equally_directed_lines(X1,X2)
<=> ~ unequally_directed_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',a4_defns) ).
fof(c_0_4,negated_conjecture,
~ ! [X4,X5] :
( equally_directed_lines(X4,reverse_line(X5))
=> equally_directed_opposite_lines(X4,X5) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_5,negated_conjecture,
( equally_directed_lines(esk1_0,reverse_line(esk2_0))
& ~ equally_directed_opposite_lines(esk1_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X3,X4,X3,X4] :
( ( ~ equally_directed_opposite_lines(X3,X4)
| ~ unequally_directed_opposite_lines(X3,X4) )
& ( unequally_directed_opposite_lines(X3,X4)
| equally_directed_opposite_lines(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[a5_defns])])])])]) ).
fof(c_0_7,plain,
! [X3,X4,X3,X4] :
( ( ~ unequally_directed_opposite_lines(X3,X4)
| unequally_directed_lines(X3,reverse_line(X4)) )
& ( ~ unequally_directed_lines(X3,reverse_line(X4))
| unequally_directed_opposite_lines(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1_defns])])])]) ).
cnf(c_0_8,negated_conjecture,
~ equally_directed_opposite_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( equally_directed_opposite_lines(X1,X2)
| unequally_directed_opposite_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X3,X4,X3,X4] :
( ( ~ equally_directed_lines(X3,X4)
| ~ unequally_directed_lines(X3,X4) )
& ( unequally_directed_lines(X3,X4)
| equally_directed_lines(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[a4_defns])])])])]) ).
cnf(c_0_11,plain,
( unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_opposite_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
unequally_directed_opposite_lines(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( ~ unequally_directed_lines(X1,X2)
| ~ equally_directed_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
equally_directed_lines(esk1_0,reverse_line(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
unequally_directed_lines(esk1_0,reverse_line(esk2_0)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09 % Problem : GEO265+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.09 % Command : run_ET %s %d
% 0.10/0.28 % Computer : n032.cluster.edu
% 0.10/0.28 % Model : x86_64 x86_64
% 0.10/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.28 % Memory : 8042.1875MB
% 0.10/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.28 % CPULimit : 300
% 0.10/0.28 % WCLimit : 600
% 0.10/0.28 % DateTime : Fri Jun 17 22:14:32 EDT 2022
% 0.10/0.28 % CPUTime :
% 0.16/1.35 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.16/1.35 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.16/1.35 # Preprocessing time : 0.015 s
% 0.16/1.35
% 0.16/1.35 # Proof found!
% 0.16/1.35 # SZS status Theorem
% 0.16/1.35 # SZS output start CNFRefutation
% See solution above
% 0.16/1.35 # Proof object total steps : 17
% 0.16/1.35 # Proof object clause steps : 8
% 0.16/1.35 # Proof object formula steps : 9
% 0.16/1.35 # Proof object conjectures : 8
% 0.16/1.35 # Proof object clause conjectures : 5
% 0.16/1.35 # Proof object formula conjectures : 3
% 0.16/1.35 # Proof object initial clauses used : 5
% 0.16/1.35 # Proof object initial formulas used : 4
% 0.16/1.35 # Proof object generating inferences : 3
% 0.16/1.35 # Proof object simplifying inferences : 2
% 0.16/1.35 # Training examples: 0 positive, 0 negative
% 0.16/1.35 # Parsed axioms : 37
% 0.16/1.35 # Removed by relevancy pruning/SinE : 14
% 0.16/1.35 # Initial clauses : 36
% 0.16/1.35 # Removed in clause preprocessing : 0
% 0.16/1.35 # Initial clauses in saturation : 36
% 0.16/1.35 # Processed clauses : 43
% 0.16/1.35 # ...of these trivial : 0
% 0.16/1.35 # ...subsumed : 12
% 0.16/1.35 # ...remaining for further processing : 30
% 0.16/1.35 # Other redundant clauses eliminated : 0
% 0.16/1.35 # Clauses deleted for lack of memory : 0
% 0.16/1.35 # Backward-subsumed : 0
% 0.16/1.35 # Backward-rewritten : 0
% 0.16/1.35 # Generated clauses : 32
% 0.16/1.35 # ...of the previous two non-trivial : 28
% 0.16/1.35 # Contextual simplify-reflections : 6
% 0.16/1.35 # Paramodulations : 26
% 0.16/1.35 # Factorizations : 6
% 0.16/1.35 # Equation resolutions : 0
% 0.16/1.35 # Current number of processed clauses : 30
% 0.16/1.35 # Positive orientable unit clauses : 5
% 0.16/1.35 # Positive unorientable unit clauses: 0
% 0.16/1.35 # Negative unit clauses : 8
% 0.16/1.35 # Non-unit-clauses : 17
% 0.16/1.35 # Current number of unprocessed clauses: 21
% 0.16/1.35 # ...number of literals in the above : 51
% 0.16/1.35 # Current number of archived formulas : 0
% 0.16/1.35 # Current number of archived clauses : 0
% 0.16/1.35 # Clause-clause subsumption calls (NU) : 140
% 0.16/1.35 # Rec. Clause-clause subsumption calls : 114
% 0.16/1.35 # Non-unit clause-clause subsumptions : 10
% 0.16/1.35 # Unit Clause-clause subsumption calls : 12
% 0.16/1.35 # Rewrite failures with RHS unbound : 0
% 0.16/1.35 # BW rewrite match attempts : 0
% 0.16/1.35 # BW rewrite match successes : 0
% 0.16/1.35 # Condensation attempts : 0
% 0.16/1.35 # Condensation successes : 0
% 0.16/1.35 # Termbank termtop insertions : 2367
% 0.16/1.35
% 0.16/1.35 # -------------------------------------------------
% 0.16/1.35 # User time : 0.014 s
% 0.16/1.35 # System time : 0.003 s
% 0.16/1.35 # Total time : 0.017 s
% 0.16/1.35 # Maximum resident set size: 3024 pages
%------------------------------------------------------------------------------