TSTP Solution File: GEO192+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO192+1 : TPTP v8.1.0. Released v3.3.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:04:30 EDT 2022
% Result : Theorem 0.19s 1.36s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 10 unt; 0 def)
% Number of atoms : 60 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 54 ( 23 ~; 19 |; 4 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( apart_point_and_line(intersection_point(X1,X2),X3)
=> ( distinct_lines(X1,X3)
& distinct_lines(X2,X3) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',con) ).
fof(ceq2,axiom,
! [X1,X2,X3] :
( apart_point_and_line(X1,X2)
=> ( distinct_lines(X2,X3)
| apart_point_and_line(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ceq2) ).
fof(ci3,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci3) ).
fof(apart5,axiom,
! [X1,X2,X3] :
( distinct_lines(X1,X2)
=> ( distinct_lines(X1,X3)
| distinct_lines(X2,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart5) ).
fof(ci4,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci4) ).
fof(apart2,axiom,
! [X1] : ~ distinct_lines(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart2) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( apart_point_and_line(intersection_point(X1,X2),X3)
=> ( distinct_lines(X1,X3)
& distinct_lines(X2,X3) ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_7,plain,
! [X4,X5,X6] :
( ~ apart_point_and_line(X4,X5)
| distinct_lines(X5,X6)
| apart_point_and_line(X4,X6) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq2])])])]) ).
fof(c_0_8,negated_conjecture,
( convergent_lines(esk1_0,esk2_0)
& apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
& ( ~ distinct_lines(esk1_0,esk3_0)
| ~ distinct_lines(esk2_0,esk3_0) ) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_9,plain,
! [X3,X4] :
( ~ convergent_lines(X3,X4)
| ~ apart_point_and_line(intersection_point(X3,X4),X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ci3])])]) ).
cnf(c_0_10,plain,
( apart_point_and_line(X1,X2)
| distinct_lines(X3,X2)
| ~ apart_point_and_line(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X4,X5,X6] :
( ~ distinct_lines(X4,X5)
| distinct_lines(X4,X6)
| distinct_lines(X5,X6) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart5])])])]) ).
cnf(c_0_13,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
| distinct_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_16,plain,
! [X3,X4] :
( ~ convergent_lines(X3,X4)
| ~ apart_point_and_line(intersection_point(X3,X4),X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ci4])])]) ).
fof(c_0_17,plain,
! [X2] : ~ distinct_lines(X2,X2),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[apart2])]) ).
cnf(c_0_18,plain,
( distinct_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ distinct_lines(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
distinct_lines(esk3_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_20,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
~ distinct_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( distinct_lines(esk3_0,X1)
| distinct_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
distinct_lines(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_14]),c_0_15])]) ).
cnf(c_0_24,negated_conjecture,
( ~ distinct_lines(esk2_0,esk3_0)
| ~ distinct_lines(esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,negated_conjecture,
distinct_lines(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( distinct_lines(esk3_0,X1)
| distinct_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
~ distinct_lines(esk2_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_26]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : GEO192+1 : TPTP v8.1.0. Released v3.3.0.
% 0.05/0.10 % Command : run_ET %s %d
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Sat Jun 18 05:22:01 EDT 2022
% 0.11/0.30 % CPUTime :
% 0.19/1.36 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.19/1.36 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.19/1.36 # Preprocessing time : 0.011 s
% 0.19/1.36
% 0.19/1.36 # Proof found!
% 0.19/1.36 # SZS status Theorem
% 0.19/1.36 # SZS output start CNFRefutation
% See solution above
% 0.19/1.36 # Proof object total steps : 29
% 0.19/1.36 # Proof object clause steps : 16
% 0.19/1.36 # Proof object formula steps : 13
% 0.19/1.36 # Proof object conjectures : 14
% 0.19/1.36 # Proof object clause conjectures : 11
% 0.19/1.36 # Proof object formula conjectures : 3
% 0.19/1.36 # Proof object initial clauses used : 8
% 0.19/1.36 # Proof object initial formulas used : 6
% 0.19/1.36 # Proof object generating inferences : 7
% 0.19/1.36 # Proof object simplifying inferences : 7
% 0.19/1.36 # Training examples: 0 positive, 0 negative
% 0.19/1.36 # Parsed axioms : 15
% 0.19/1.36 # Removed by relevancy pruning/SinE : 2
% 0.19/1.36 # Initial clauses : 15
% 0.19/1.36 # Removed in clause preprocessing : 0
% 0.19/1.36 # Initial clauses in saturation : 15
% 0.19/1.36 # Processed clauses : 33
% 0.19/1.36 # ...of these trivial : 0
% 0.19/1.36 # ...subsumed : 3
% 0.19/1.36 # ...remaining for further processing : 30
% 0.19/1.36 # Other redundant clauses eliminated : 0
% 0.19/1.36 # Clauses deleted for lack of memory : 0
% 0.19/1.36 # Backward-subsumed : 0
% 0.19/1.36 # Backward-rewritten : 1
% 0.19/1.36 # Generated clauses : 50
% 0.19/1.36 # ...of the previous two non-trivial : 43
% 0.19/1.36 # Contextual simplify-reflections : 0
% 0.19/1.36 # Paramodulations : 48
% 0.19/1.36 # Factorizations : 2
% 0.19/1.36 # Equation resolutions : 0
% 0.19/1.36 # Current number of processed clauses : 29
% 0.19/1.36 # Positive orientable unit clauses : 7
% 0.19/1.36 # Positive unorientable unit clauses: 0
% 0.19/1.36 # Negative unit clauses : 4
% 0.19/1.36 # Non-unit-clauses : 18
% 0.19/1.36 # Current number of unprocessed clauses: 25
% 0.19/1.36 # ...number of literals in the above : 95
% 0.19/1.36 # Current number of archived formulas : 0
% 0.19/1.36 # Current number of archived clauses : 1
% 0.19/1.36 # Clause-clause subsumption calls (NU) : 20
% 0.19/1.36 # Rec. Clause-clause subsumption calls : 12
% 0.19/1.36 # Non-unit clause-clause subsumptions : 3
% 0.19/1.36 # Unit Clause-clause subsumption calls : 14
% 0.19/1.36 # Rewrite failures with RHS unbound : 0
% 0.19/1.36 # BW rewrite match attempts : 1
% 0.19/1.36 # BW rewrite match successes : 1
% 0.19/1.36 # Condensation attempts : 0
% 0.19/1.36 # Condensation successes : 0
% 0.19/1.36 # Termbank termtop insertions : 1498
% 0.19/1.36
% 0.19/1.36 # -------------------------------------------------
% 0.19/1.36 # User time : 0.012 s
% 0.19/1.36 # System time : 0.001 s
% 0.19/1.36 # Total time : 0.012 s
% 0.19/1.36 # Maximum resident set size: 2816 pages
%------------------------------------------------------------------------------