TSTP Solution File: GEO259+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GEO259+1 : TPTP v8.2.0. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 300s
% DateTime : Mon May 20 19:58:58 EDT 2024
% Result : Theorem 0.93s 0.58s
% Output : CNFRefutation 0.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 44 ( 14 unt; 0 def)
% Number of atoms : 108 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 100 ( 36 ~; 42 |; 16 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 75 ( 2 sgn 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(oag5,axiom,
! [X2] : ~ unequally_directed_lines(X2,X2),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag5) ).
fof(oag8,axiom,
! [X2,X3] :
( ( line(X2)
& line(X3) )
=> ( unequally_directed_lines(X2,X3)
| unequally_directed_lines(X2,reverse_line(X3)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag8) ).
fof(oagco4,axiom,
! [X2] :
( line(X2)
=> line(reverse_line(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oagco4) ).
fof(con,conjecture,
! [X2,X1,X4,X5] :
( ( line(X2)
& distinct_points(X1,X5)
& distinct_points(X4,X5)
& distinct_points(X1,X4) )
=> ~ ( between_on_line(X2,X1,X4,X5)
& between_on_line(X2,X4,X1,X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(oag9,axiom,
! [X2,X3] :
( ( unequally_directed_lines(X2,X3)
& unequally_directed_lines(X2,reverse_line(X3)) )
=> ( left_convergent_lines(X2,X3)
| left_convergent_lines(X2,reverse_line(X3)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag9) ).
fof(oag11,axiom,
! [X2,X3] :
~ ( left_convergent_lines(X2,X3)
| left_convergent_lines(X2,reverse_line(X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag11) ).
fof(oag6,axiom,
! [X2,X3,X6] :
( unequally_directed_lines(X2,X3)
=> ( unequally_directed_lines(X2,X6)
| unequally_directed_lines(X3,X6) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag6) ).
fof(oagco9,axiom,
! [X1,X4] : ~ unequally_directed_lines(line_connecting(X1,X4),reverse_line(line_connecting(X4,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oagco9) ).
fof(c_0_8,plain,
! [X2] : ~ unequally_directed_lines(X2,X2),
inference(fof_simplification,[status(thm)],[oag5]) ).
fof(c_0_9,plain,
! [X29] : ~ unequally_directed_lines(X29,X29),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_8])]) ).
fof(c_0_10,plain,
! [X36,X37] :
( ~ line(X36)
| ~ line(X37)
| unequally_directed_lines(X36,X37)
| unequally_directed_lines(X36,reverse_line(X37)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag8])])]) ).
fof(c_0_11,plain,
! [X50] :
( ~ line(X50)
| line(reverse_line(X50)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oagco4])])]) ).
fof(c_0_12,negated_conjecture,
~ ! [X2,X1,X4,X5] :
( ( line(X2)
& distinct_points(X1,X5)
& distinct_points(X4,X5)
& distinct_points(X1,X4) )
=> ~ ( between_on_line(X2,X1,X4,X5)
& between_on_line(X2,X4,X1,X5) ) ),
inference(assume_negation,[status(cth)],[con]) ).
cnf(c_0_13,plain,
~ unequally_directed_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( unequally_directed_lines(X1,X2)
| unequally_directed_lines(X1,reverse_line(X2))
| ~ line(X1)
| ~ line(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( line(reverse_line(X1))
| ~ line(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,negated_conjecture,
( line(esk1_0)
& distinct_points(esk2_0,esk4_0)
& distinct_points(esk3_0,esk4_0)
& distinct_points(esk2_0,esk3_0)
& between_on_line(esk1_0,esk2_0,esk3_0,esk4_0)
& between_on_line(esk1_0,esk3_0,esk2_0,esk4_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_17,plain,
! [X38,X39] :
( ~ unequally_directed_lines(X38,X39)
| ~ unequally_directed_lines(X38,reverse_line(X39))
| left_convergent_lines(X38,X39)
| left_convergent_lines(X38,reverse_line(X39)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag9])])]) ).
fof(c_0_18,plain,
! [X42,X43] :
( ~ left_convergent_lines(X42,X43)
& ~ left_convergent_lines(X42,reverse_line(X43)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag11])])]) ).
fof(c_0_19,plain,
! [X30,X31,X32] :
( ~ unequally_directed_lines(X30,X31)
| unequally_directed_lines(X30,X32)
| unequally_directed_lines(X31,X32) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag6])])]) ).
cnf(c_0_20,plain,
( unequally_directed_lines(reverse_line(X1),X1)
| ~ line(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_21,negated_conjecture,
line(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( left_convergent_lines(X1,X2)
| left_convergent_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
~ left_convergent_lines(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( unequally_directed_lines(X1,X3)
| unequally_directed_lines(X2,X3)
| ~ unequally_directed_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
unequally_directed_lines(reverse_line(esk1_0),esk1_0),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( ~ unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_22,c_0_23]),c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( unequally_directed_lines(reverse_line(esk1_0),X1)
| unequally_directed_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( unequally_directed_lines(esk1_0,reverse_line(X1))
| ~ unequally_directed_lines(reverse_line(esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
( unequally_directed_lines(reverse_line(esk1_0),X1)
| unequally_directed_lines(esk1_0,X2)
| unequally_directed_lines(X2,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_27]) ).
cnf(c_0_30,plain,
( unequally_directed_lines(reverse_line(X1),X2)
| unequally_directed_lines(X1,X2)
| ~ line(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_20]) ).
fof(c_0_31,plain,
! [X1,X4] : ~ unequally_directed_lines(line_connecting(X1,X4),reverse_line(line_connecting(X4,X1))),
inference(fof_simplification,[status(thm)],[oagco9]) ).
cnf(c_0_32,negated_conjecture,
( unequally_directed_lines(esk1_0,reverse_line(X1))
| unequally_directed_lines(esk1_0,X2)
| unequally_directed_lines(X2,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( unequally_directed_lines(X1,reverse_line(X2))
| ~ line(X1)
| ~ unequally_directed_lines(reverse_line(X1),X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_30]) ).
fof(c_0_34,plain,
! [X58,X59] : ~ unequally_directed_lines(line_connecting(X58,X59),reverse_line(line_connecting(X59,X58))),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_31])]) ).
cnf(c_0_35,negated_conjecture,
( unequally_directed_lines(esk1_0,X1)
| unequally_directed_lines(X1,X2)
| ~ unequally_directed_lines(esk1_0,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_32]) ).
cnf(c_0_36,plain,
( unequally_directed_lines(X1,reverse_line(X2))
| unequally_directed_lines(X1,X2)
| ~ line(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_30]) ).
cnf(c_0_37,plain,
~ unequally_directed_lines(line_connecting(X1,X2),reverse_line(line_connecting(X2,X1))),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( unequally_directed_lines(X1,reverse_line(X2))
| unequally_directed_lines(esk1_0,X2)
| unequally_directed_lines(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_21])]) ).
cnf(c_0_39,negated_conjecture,
( unequally_directed_lines(esk1_0,line_connecting(X1,X2))
| unequally_directed_lines(esk1_0,line_connecting(X2,X1)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_40,negated_conjecture,
unequally_directed_lines(esk1_0,line_connecting(X1,X1)),
inference(ef,[status(thm)],[c_0_39]) ).
cnf(c_0_41,negated_conjecture,
( unequally_directed_lines(line_connecting(X1,X1),X2)
| unequally_directed_lines(esk1_0,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_40]) ).
cnf(c_0_42,negated_conjecture,
unequally_directed_lines(esk1_0,reverse_line(line_connecting(X1,X1))),
inference(spm,[status(thm)],[c_0_37,c_0_41]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_42]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GEO259+1 : TPTP v8.2.0. Bugfixed v6.4.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 14:03:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.93/0.58 # Version: 3.1.0
% 0.93/0.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.93/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.93/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.93/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.93/0.58 # Starting sh5l with 300s (1) cores
% 0.93/0.58 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 23615 completed with status 0
% 0.93/0.58 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.93/0.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.93/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.93/0.58 # No SInE strategy applied
% 0.93/0.58 # Search class: FGHNF-FFMM21-SFFFFFNN
% 0.93/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.93/0.58 # Starting G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S with 587s (1) cores
% 0.93/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.93/0.58 # Starting new_bool_3 with 191s (1) cores
% 0.93/0.58 # Starting new_bool_1 with 191s (1) cores
% 0.93/0.58 # Starting sh5l with 191s (1) cores
% 0.93/0.58 # G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S with pid 23619 completed with status 0
% 0.93/0.58 # Result found by G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S
% 0.93/0.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.93/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.93/0.58 # No SInE strategy applied
% 0.93/0.58 # Search class: FGHNF-FFMM21-SFFFFFNN
% 0.93/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.93/0.58 # Starting G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S with 587s (1) cores
% 0.93/0.58 # Preprocessing time : 0.003 s
% 0.93/0.58 # Presaturation interreduction done
% 0.93/0.58
% 0.93/0.58 # Proof found!
% 0.93/0.58 # SZS status Theorem
% 0.93/0.58 # SZS output start CNFRefutation
% See solution above
% 0.93/0.58 # Parsed axioms : 32
% 0.93/0.58 # Removed by relevancy pruning/SinE : 0
% 0.93/0.58 # Initial clauses : 64
% 0.93/0.58 # Removed in clause preprocessing : 0
% 0.93/0.58 # Initial clauses in saturation : 64
% 0.93/0.58 # Processed clauses : 845
% 0.93/0.58 # ...of these trivial : 2
% 0.93/0.58 # ...subsumed : 494
% 0.93/0.58 # ...remaining for further processing : 349
% 0.93/0.58 # Other redundant clauses eliminated : 0
% 0.93/0.58 # Clauses deleted for lack of memory : 0
% 0.93/0.58 # Backward-subsumed : 11
% 0.93/0.58 # Backward-rewritten : 3
% 0.93/0.58 # Generated clauses : 2467
% 0.93/0.58 # ...of the previous two non-redundant : 2076
% 0.93/0.58 # ...aggressively subsumed : 0
% 0.93/0.58 # Contextual simplify-reflections : 3
% 0.93/0.58 # Paramodulations : 2030
% 0.93/0.58 # Factorizations : 434
% 0.93/0.58 # NegExts : 0
% 0.93/0.58 # Equation resolutions : 0
% 0.93/0.58 # Disequality decompositions : 0
% 0.93/0.58 # Total rewrite steps : 389
% 0.93/0.58 # ...of those cached : 370
% 0.93/0.58 # Propositional unsat checks : 0
% 0.93/0.58 # Propositional check models : 0
% 0.93/0.58 # Propositional check unsatisfiable : 0
% 0.93/0.58 # Propositional clauses : 0
% 0.93/0.58 # Propositional clauses after purity: 0
% 0.93/0.58 # Propositional unsat core size : 0
% 0.93/0.58 # Propositional preprocessing time : 0.000
% 0.93/0.58 # Propositional encoding time : 0.000
% 0.93/0.58 # Propositional solver time : 0.000
% 0.93/0.58 # Success case prop preproc time : 0.000
% 0.93/0.58 # Success case prop encoding time : 0.000
% 0.93/0.58 # Success case prop solver time : 0.000
% 0.93/0.58 # Current number of processed clauses : 296
% 0.93/0.58 # Positive orientable unit clauses : 31
% 0.93/0.58 # Positive unorientable unit clauses: 0
% 0.93/0.58 # Negative unit clauses : 14
% 0.93/0.58 # Non-unit-clauses : 251
% 0.93/0.58 # Current number of unprocessed clauses: 1328
% 0.93/0.58 # ...number of literals in the above : 5847
% 0.93/0.58 # Current number of archived formulas : 0
% 0.93/0.58 # Current number of archived clauses : 52
% 0.93/0.58 # Clause-clause subsumption calls (NU) : 13261
% 0.93/0.58 # Rec. Clause-clause subsumption calls : 4213
% 0.93/0.58 # Non-unit clause-clause subsumptions : 481
% 0.93/0.58 # Unit Clause-clause subsumption calls : 471
% 0.93/0.58 # Rewrite failures with RHS unbound : 0
% 0.93/0.58 # BW rewrite match attempts : 9
% 0.93/0.58 # BW rewrite match successes : 3
% 0.93/0.58 # Condensation attempts : 0
% 0.93/0.58 # Condensation successes : 0
% 0.93/0.58 # Termbank termtop insertions : 29615
% 0.93/0.58 # Search garbage collected termcells : 705
% 0.93/0.58
% 0.93/0.58 # -------------------------------------------------
% 0.93/0.58 # User time : 0.074 s
% 0.93/0.58 # System time : 0.004 s
% 0.93/0.58 # Total time : 0.079 s
% 0.93/0.58 # Maximum resident set size: 1884 pages
% 0.93/0.58
% 0.93/0.58 # -------------------------------------------------
% 0.93/0.58 # User time : 0.339 s
% 0.93/0.58 # System time : 0.010 s
% 0.93/0.58 # Total time : 0.349 s
% 0.93/0.58 # Maximum resident set size: 1760 pages
% 0.93/0.58 % E---3.1 exiting
% 0.93/0.58 % E exiting
%------------------------------------------------------------------------------