TSTP Solution File: GEO077-4 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GEO077-4 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:33:41 EDT 2023
% Result : Unsatisfiable 0.37s 0.53s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of clauses : 40 ( 28 unt; 12 nHn; 40 RR)
% Number of literals : 124 ( 39 equ; 64 neg)
% Maximal clause size : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-3 aty)
% Number of variables : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_G10B,axiom,
( X1 = X2
| X1 = X3
| X2 = X3
| on(X2,line_through_3_points(X1,X2,X3))
| ~ point(X1)
| ~ point(X2)
| ~ point(X3)
| ~ collinear(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.xXdzQUqBuB/E---3.1_846.p',axiom_G10B) ).
cnf(prove_points_noncollinear,negated_conjecture,
collinear(point1,point2,point3),
file('/export/starexec/sandbox/tmp/tmp.xXdzQUqBuB/E---3.1_846.p',prove_points_noncollinear) ).
cnf(point3,hypothesis,
point(point3),
file('/export/starexec/sandbox/tmp/tmp.xXdzQUqBuB/E---3.1_846.p',point3) ).
cnf(point2,hypothesis,
point(point2),
file('/export/starexec/sandbox/tmp/tmp.xXdzQUqBuB/E---3.1_846.p',point2) ).
cnf(point1,hypothesis,
point(point1),
file('/export/starexec/sandbox/tmp/tmp.xXdzQUqBuB/E---3.1_846.p',point1) ).
cnf(point2_not_point3,hypothesis,
point2 != point3,
file('/export/starexec/sandbox/tmp/tmp.xXdzQUqBuB/E---3.1_846.p',point2_not_point3) ).
cnf(point1_not_point3,hypothesis,
point1 != point3,
file('/export/starexec/sandbox/tmp/tmp.xXdzQUqBuB/E---3.1_846.p',point1_not_point3) ).
cnf(point1_not_point2,hypothesis,
point1 != point2,
file('/export/starexec/sandbox/tmp/tmp.xXdzQUqBuB/E---3.1_846.p',point1_not_point2) ).
cnf(axiom_G10D,axiom,
( X1 = X2
| X1 = X3
| X2 = X3
| line(line_through_3_points(X1,X2,X3))
| ~ point(X1)
| ~ point(X2)
| ~ point(X3)
| ~ collinear(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.xXdzQUqBuB/E---3.1_846.p',axiom_G10D) ).
cnf(axiom_G1D,axiom,
( X1 = X3
| X2 = X4
| ~ on(X1,X2)
| ~ on(X3,X2)
| ~ on(X1,X4)
| ~ on(X3,X4)
| ~ point(X1)
| ~ point(X3)
| ~ line(X2)
| ~ line(X4) ),
file('/export/starexec/sandbox/tmp/tmp.xXdzQUqBuB/E---3.1_846.p',axiom_G1D) ).
cnf(point2_on_line,hypothesis,
on(point2,a_line),
file('/export/starexec/sandbox/tmp/tmp.xXdzQUqBuB/E---3.1_846.p',point2_on_line) ).
cnf(line,hypothesis,
line(a_line),
file('/export/starexec/sandbox/tmp/tmp.xXdzQUqBuB/E---3.1_846.p',line) ).
cnf(axiom_G10A,axiom,
( X1 = X2
| X1 = X3
| X2 = X3
| on(X1,line_through_3_points(X1,X2,X3))
| ~ point(X1)
| ~ point(X2)
| ~ point(X3)
| ~ collinear(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.xXdzQUqBuB/E---3.1_846.p',axiom_G10A) ).
cnf(axiom_G10C,axiom,
( X1 = X2
| X1 = X3
| X2 = X3
| on(X3,line_through_3_points(X1,X2,X3))
| ~ point(X1)
| ~ point(X2)
| ~ point(X3)
| ~ collinear(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.xXdzQUqBuB/E---3.1_846.p',axiom_G10C) ).
cnf(point1_on_line,hypothesis,
on(point1,a_line),
file('/export/starexec/sandbox/tmp/tmp.xXdzQUqBuB/E---3.1_846.p',point1_on_line) ).
cnf(point3_not_on_line,hypothesis,
~ on(point3,a_line),
file('/export/starexec/sandbox/tmp/tmp.xXdzQUqBuB/E---3.1_846.p',point3_not_on_line) ).
cnf(c_0_16,axiom,
( X1 = X2
| X1 = X3
| X2 = X3
| on(X2,line_through_3_points(X1,X2,X3))
| ~ point(X1)
| ~ point(X2)
| ~ point(X3)
| ~ collinear(X1,X2,X3) ),
axiom_G10B ).
cnf(c_0_17,negated_conjecture,
collinear(point1,point2,point3),
prove_points_noncollinear ).
cnf(c_0_18,hypothesis,
point(point3),
point3 ).
cnf(c_0_19,hypothesis,
point(point2),
point2 ).
cnf(c_0_20,hypothesis,
point(point1),
point1 ).
cnf(c_0_21,hypothesis,
point2 != point3,
point2_not_point3 ).
cnf(c_0_22,hypothesis,
point1 != point3,
point1_not_point3 ).
cnf(c_0_23,hypothesis,
point1 != point2,
point1_not_point2 ).
cnf(c_0_24,axiom,
( X1 = X2
| X1 = X3
| X2 = X3
| line(line_through_3_points(X1,X2,X3))
| ~ point(X1)
| ~ point(X2)
| ~ point(X3)
| ~ collinear(X1,X2,X3) ),
axiom_G10D ).
cnf(c_0_25,axiom,
( X1 = X3
| X2 = X4
| ~ on(X1,X2)
| ~ on(X3,X2)
| ~ on(X1,X4)
| ~ on(X3,X4)
| ~ point(X1)
| ~ point(X3)
| ~ line(X2)
| ~ line(X4) ),
axiom_G1D ).
cnf(c_0_26,negated_conjecture,
on(point2,line_through_3_points(point1,point2,point3)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]),c_0_20])]),c_0_21]),c_0_22]),c_0_23]) ).
cnf(c_0_27,negated_conjecture,
line(line_through_3_points(point1,point2,point3)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_17]),c_0_18]),c_0_19]),c_0_20])]),c_0_21]),c_0_22]),c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( X1 = line_through_3_points(point1,point2,point3)
| X2 = point2
| ~ line(X1)
| ~ point(X2)
| ~ on(X2,line_through_3_points(point1,point2,point3))
| ~ on(point2,X1)
| ~ on(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_19])]) ).
cnf(c_0_29,hypothesis,
on(point2,a_line),
point2_on_line ).
cnf(c_0_30,hypothesis,
line(a_line),
line ).
cnf(c_0_31,axiom,
( X1 = X2
| X1 = X3
| X2 = X3
| on(X1,line_through_3_points(X1,X2,X3))
| ~ point(X1)
| ~ point(X2)
| ~ point(X3)
| ~ collinear(X1,X2,X3) ),
axiom_G10A ).
cnf(c_0_32,axiom,
( X1 = X2
| X1 = X3
| X2 = X3
| on(X3,line_through_3_points(X1,X2,X3))
| ~ point(X1)
| ~ point(X2)
| ~ point(X3)
| ~ collinear(X1,X2,X3) ),
axiom_G10C ).
cnf(c_0_33,hypothesis,
( line_through_3_points(point1,point2,point3) = a_line
| X1 = point2
| ~ point(X1)
| ~ on(X1,line_through_3_points(point1,point2,point3))
| ~ on(X1,a_line) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_34,hypothesis,
on(point1,a_line),
point1_on_line ).
cnf(c_0_35,negated_conjecture,
on(point1,line_through_3_points(point1,point2,point3)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_17]),c_0_18]),c_0_19]),c_0_20])]),c_0_21]),c_0_22]),c_0_23]) ).
cnf(c_0_36,negated_conjecture,
on(point3,line_through_3_points(point1,point2,point3)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_17]),c_0_18]),c_0_19]),c_0_20])]),c_0_21]),c_0_22]),c_0_23]) ).
cnf(c_0_37,hypothesis,
line_through_3_points(point1,point2,point3) = a_line,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_20]),c_0_35])]),c_0_23]) ).
cnf(c_0_38,hypothesis,
~ on(point3,a_line),
point3_not_on_line ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GEO077-4 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n021.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Oct 3 06:52:29 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.23/0.51 Running first-order model finding
% 0.23/0.51 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.xXdzQUqBuB/E---3.1_846.p
% 0.37/0.53 # Version: 3.1pre001
% 0.37/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.37/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.37/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.37/0.53 # Starting sh5l with 300s (1) cores
% 0.37/0.53 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 927 completed with status 0
% 0.37/0.53 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.37/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.37/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.37/0.53 # No SInE strategy applied
% 0.37/0.53 # Search class: FGHSF-FFMM31-SFFFFFNN
% 0.37/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.37/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 811s (1) cores
% 0.37/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.37/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.37/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.37/0.53 # Starting U----_212g_01_C10_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.37/0.53 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 935 completed with status 0
% 0.37/0.53 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.37/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.37/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.37/0.53 # No SInE strategy applied
% 0.37/0.53 # Search class: FGHSF-FFMM31-SFFFFFNN
% 0.37/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.37/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 811s (1) cores
% 0.37/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.37/0.53 # Preprocessing time : 0.001 s
% 0.37/0.53 # Presaturation interreduction done
% 0.37/0.53
% 0.37/0.53 # Proof found!
% 0.37/0.53 # SZS status Unsatisfiable
% 0.37/0.53 # SZS output start CNFRefutation
% See solution above
% 0.37/0.53 # Parsed axioms : 42
% 0.37/0.53 # Removed by relevancy pruning/SinE : 0
% 0.37/0.53 # Initial clauses : 42
% 0.37/0.53 # Removed in clause preprocessing : 0
% 0.37/0.53 # Initial clauses in saturation : 42
% 0.37/0.53 # Processed clauses : 99
% 0.37/0.53 # ...of these trivial : 0
% 0.37/0.53 # ...subsumed : 0
% 0.37/0.53 # ...remaining for further processing : 99
% 0.37/0.53 # Other redundant clauses eliminated : 0
% 0.37/0.53 # Clauses deleted for lack of memory : 0
% 0.37/0.53 # Backward-subsumed : 0
% 0.37/0.53 # Backward-rewritten : 10
% 0.37/0.53 # Generated clauses : 115
% 0.37/0.53 # ...of the previous two non-redundant : 120
% 0.37/0.53 # ...aggressively subsumed : 0
% 0.37/0.53 # Contextual simplify-reflections : 1
% 0.37/0.53 # Paramodulations : 115
% 0.37/0.53 # Factorizations : 0
% 0.37/0.53 # NegExts : 0
% 0.37/0.53 # Equation resolutions : 0
% 0.37/0.53 # Total rewrite steps : 92
% 0.37/0.53 # Propositional unsat checks : 0
% 0.37/0.53 # Propositional check models : 0
% 0.37/0.53 # Propositional check unsatisfiable : 0
% 0.37/0.53 # Propositional clauses : 0
% 0.37/0.53 # Propositional clauses after purity: 0
% 0.37/0.53 # Propositional unsat core size : 0
% 0.37/0.53 # Propositional preprocessing time : 0.000
% 0.37/0.53 # Propositional encoding time : 0.000
% 0.37/0.53 # Propositional solver time : 0.000
% 0.37/0.53 # Success case prop preproc time : 0.000
% 0.37/0.53 # Success case prop encoding time : 0.000
% 0.37/0.53 # Success case prop solver time : 0.000
% 0.37/0.53 # Current number of processed clauses : 47
% 0.37/0.53 # Positive orientable unit clauses : 9
% 0.37/0.53 # Positive unorientable unit clauses: 0
% 0.37/0.53 # Negative unit clauses : 4
% 0.37/0.53 # Non-unit-clauses : 34
% 0.37/0.53 # Current number of unprocessed clauses: 100
% 0.37/0.53 # ...number of literals in the above : 1028
% 0.37/0.53 # Current number of archived formulas : 0
% 0.37/0.53 # Current number of archived clauses : 52
% 0.37/0.53 # Clause-clause subsumption calls (NU) : 800
% 0.37/0.53 # Rec. Clause-clause subsumption calls : 43
% 0.37/0.53 # Non-unit clause-clause subsumptions : 1
% 0.37/0.53 # Unit Clause-clause subsumption calls : 6
% 0.37/0.53 # Rewrite failures with RHS unbound : 0
% 0.37/0.53 # BW rewrite match attempts : 1
% 0.37/0.53 # BW rewrite match successes : 1
% 0.37/0.53 # Condensation attempts : 0
% 0.37/0.53 # Condensation successes : 0
% 0.37/0.53 # Termbank termtop insertions : 5034
% 0.37/0.53
% 0.37/0.53 # -------------------------------------------------
% 0.37/0.53 # User time : 0.010 s
% 0.37/0.53 # System time : 0.002 s
% 0.37/0.53 # Total time : 0.012 s
% 0.37/0.53 # Maximum resident set size: 1684 pages
% 0.37/0.53
% 0.37/0.53 # -------------------------------------------------
% 0.37/0.53 # User time : 0.050 s
% 0.37/0.53 # System time : 0.009 s
% 0.37/0.53 # Total time : 0.059 s
% 0.37/0.53 # Maximum resident set size: 1728 pages
% 0.37/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------