TSTP Solution File: GEO300+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO300+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:32:32 EDT 2023
% Result : Theorem 0.20s 0.63s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 22 unt; 0 def)
% Number of atoms : 99 ( 53 equ)
% Maximal formula atoms : 22 ( 3 avg)
% Number of connectives : 102 ( 33 ~; 21 |; 47 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 18 ( 18 usr; 15 con; 0-3 aty)
% Number of variables : 30 ( 0 sgn; 10 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof('and(neg(neg(conjunct2(conjunct2(conjunct2(plural(comma_conjunct2(268))))))), and(holds(conjunct1(conjunct2(conjunct2(plural(comma_conjunct2(268))))), 1194, 0), and(holds(conjunct1(conjunct2(plural(comma_conjunct2(268)))), 1193, 0), and(holds(conjunct1(plural(comma_conjunct2(268))), 1192, 0), and(qe(s3(plural(comma_conjunct2(268)))), and(qe(s2(plural(comma_conjunct2(268)))), and(qe(s1(plural(comma_conjunct2(268)))), and(pred(comma_conjunct1(268), 9), and(pred(comma_conjunct1(268), 8), and(pred(comma_conjunct1(268), 7), and(qe(s3(plural(268))), and(qe(s2(plural(268))), qe(s1(plural(268)))))))))))))))',axiom,
( ~ ? [X8] :
( ron(vd1187,X8)
& ron(vd1186,X8)
& ron(vd1185,X8)
& rline(X8) )
& vangle(vd1179,vd1178,vd1180) = vangle(vd1186,vd1185,vd1187)
& vf(vd1178,vd1180) = vf(vd1185,vd1187)
& vf(vd1178,vd1179) = vf(vd1185,vd1186)
& ? [X9] :
( vd1187 = X9
& rpoint(X9) )
& ? [X10] :
( vd1186 = X10
& rpoint(X10) )
& ? [X11] :
( vd1185 = X11
& rpoint(X11) )
& vd1179 != vd1180
& vd1178 != vd1180
& vd1178 != vd1179
& ? [X12] :
( vd1180 = X12
& rpoint(X12) )
& ? [X13] :
( vd1179 = X13
& rpoint(X13) )
& ? [X14] :
( vd1178 = X14
& rpoint(X14) ) ),
file('/export/starexec/sandbox/tmp/tmp.dH9TiQuV7Y/E---3.1_8126.p','and(neg(neg(conjunct2(conjunct2(conjunct2(plural(comma_conjunct2(268))))))), and(holds(conjunct1(conjunct2(conjunct2(plural(comma_conjunct2(268))))), 1194, 0), and(holds(conjunct1(conjunct2(plural(comma_conjunct2(268)))), 1193, 0), and(holds(conjunct1(plural(comma_conjunct2(268))), 1192, 0), and(qe(s3(plural(comma_conjunct2(268)))), and(qe(s2(plural(comma_conjunct2(268)))), and(qe(s1(plural(comma_conjunct2(268)))), and(pred(comma_conjunct1(268), 9), and(pred(comma_conjunct1(268), 8), and(pred(comma_conjunct1(268), 7), and(qe(s3(plural(268))), and(qe(s2(plural(268))), qe(s1(plural(268)))))))))))))))') ).
fof('holds(331, 1260, 0)',conjecture,
vf(vd1185,vd1201) = vplus(vf(vd1185,vd1187),vf(vd1187,vd1201)),
file('/export/starexec/sandbox/tmp/tmp.dH9TiQuV7Y/E---3.1_8126.p','holds(331, 1260, 0)') ).
fof('qe(s3(plural(271)))',axiom,
? [X7] :
( vd1201 = X7
& rpoint(X7) ),
file('/export/starexec/sandbox/tmp/tmp.dH9TiQuV7Y/E---3.1_8126.p','qe(s3(plural(271)))') ).
fof('qu(cond(axiom(180), 0), imp(cond(axiom(180), 0)))',axiom,
! [X1,X2,X3] :
( ( rR(X2,X1,X3)
& ? [X4] :
( X3 = X4
& rpoint(X4) )
& ? [X5] :
( X2 = X5
& rpoint(X5) )
& ? [X6] :
( X1 = X6
& rpoint(X6) ) )
=> vplus(vf(X1,X2),vf(X2,X3)) = vf(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.dH9TiQuV7Y/E---3.1_8126.p','qu(cond(axiom(180), 0), imp(cond(axiom(180), 0)))') ).
fof('holds(291, 1230, 0)',axiom,
vd1199 = vd1185,
file('/export/starexec/sandbox/tmp/tmp.dH9TiQuV7Y/E---3.1_8126.p','holds(291, 1230, 0)') ).
fof('holds(314, 1247, 0)',axiom,
vf(vd1199,vd1201) = vf(vd1185,vd1187),
file('/export/starexec/sandbox/tmp/tmp.dH9TiQuV7Y/E---3.1_8126.p','holds(314, 1247, 0)') ).
fof('holds(330, 1259, 0)',axiom,
rR(vd1187,vd1185,vd1201),
file('/export/starexec/sandbox/tmp/tmp.dH9TiQuV7Y/E---3.1_8126.p','holds(330, 1259, 0)') ).
fof(c_0_7,plain,
! [X762] :
( ( ~ ron(vd1187,X762)
| ~ ron(vd1186,X762)
| ~ ron(vd1185,X762)
| ~ rline(X762) )
& vangle(vd1179,vd1178,vd1180) = vangle(vd1186,vd1185,vd1187)
& vf(vd1178,vd1180) = vf(vd1185,vd1187)
& vf(vd1178,vd1179) = vf(vd1185,vd1186)
& vd1187 = esk2_0
& rpoint(esk2_0)
& vd1186 = esk3_0
& rpoint(esk3_0)
& vd1185 = esk4_0
& rpoint(esk4_0)
& vd1179 != vd1180
& vd1178 != vd1180
& vd1178 != vd1179
& vd1180 = esk5_0
& rpoint(esk5_0)
& vd1179 = esk6_0
& rpoint(esk6_0)
& vd1178 = esk7_0
& rpoint(esk7_0) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['and(neg(neg(conjunct2(conjunct2(conjunct2(plural(comma_conjunct2(268))))))), and(holds(conjunct1(conjunct2(conjunct2(plural(comma_conjunct2(268))))), 1194, 0), and(holds(conjunct1(conjunct2(plural(comma_conjunct2(268)))), 1193, 0), and(holds(conjunct1(plural(comma_conjunct2(268))), 1192, 0), and(qe(s3(plural(comma_conjunct2(268)))), and(qe(s2(plural(comma_conjunct2(268)))), and(qe(s1(plural(comma_conjunct2(268)))), and(pred(comma_conjunct1(268), 9), and(pred(comma_conjunct1(268), 8), and(pred(comma_conjunct1(268), 7), and(qe(s3(plural(268))), and(qe(s2(plural(268))), qe(s1(plural(268)))))))))))))))'])])])]) ).
fof(c_0_8,negated_conjecture,
vf(vd1185,vd1201) != vplus(vf(vd1185,vd1187),vf(vd1187,vd1201)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(331, 1260, 0)'])]) ).
fof(c_0_9,plain,
( vd1201 = esk1_0
& rpoint(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s3(plural(271)))'])]) ).
fof(c_0_10,plain,
! [X755,X756,X757,X758,X759,X760] :
( ~ rR(X756,X755,X757)
| X757 != X758
| ~ rpoint(X758)
| X756 != X759
| ~ rpoint(X759)
| X755 != X760
| ~ rpoint(X760)
| vplus(vf(X755,X756),vf(X756,X757)) = vf(X755,X757) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(180), 0), imp(cond(axiom(180), 0)))'])])]) ).
cnf(c_0_11,plain,
vd1185 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
vd1199 = vd1185,
inference(split_conjunct,[status(thm)],['holds(291, 1230, 0)']) ).
cnf(c_0_13,negated_conjecture,
vf(vd1185,vd1201) != vplus(vf(vd1185,vd1187),vf(vd1187,vd1201)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
vd1187 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,plain,
vd1201 = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
vf(vd1199,vd1201) = vf(vd1185,vd1187),
inference(split_conjunct,[status(thm)],['holds(314, 1247, 0)']) ).
cnf(c_0_17,plain,
( vplus(vf(X2,X1),vf(X1,X3)) = vf(X2,X3)
| ~ rR(X1,X2,X3)
| X3 != X4
| ~ rpoint(X4)
| X1 != X5
| ~ rpoint(X5)
| X2 != X6
| ~ rpoint(X6) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
rR(vd1187,vd1185,vd1201),
inference(split_conjunct,[status(thm)],['holds(330, 1259, 0)']) ).
cnf(c_0_19,plain,
rpoint(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,plain,
esk4_0 = vd1199,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_21,negated_conjecture,
vplus(vf(vd1199,esk2_0),vf(esk2_0,esk1_0)) != vf(vd1199,esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_12]),c_0_14]),c_0_14]),c_0_15]),c_0_12]),c_0_15]) ).
cnf(c_0_22,plain,
vf(vd1199,esk2_0) = vf(vd1199,esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_12]),c_0_14]),c_0_15]) ).
cnf(c_0_23,plain,
( vplus(vf(X1,X2),vf(X2,X3)) = vf(X1,X3)
| ~ rpoint(X1)
| ~ rpoint(X2)
| ~ rpoint(X3)
| ~ rR(X2,X1,X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_17])])]) ).
cnf(c_0_24,plain,
rR(esk2_0,vd1199,esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_14]),c_0_12]),c_0_15]) ).
cnf(c_0_25,plain,
rpoint(vd1199),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
rpoint(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_27,plain,
rpoint(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,negated_conjecture,
vplus(vf(vd1199,esk1_0),vf(esk2_0,esk1_0)) != vf(vd1199,esk1_0),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_22]),c_0_25]),c_0_26]),c_0_27])]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.14 % Problem : GEO300+1 : TPTP v8.1.2. Released v4.1.0.
% 0.10/0.15 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n023.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Oct 3 07:12:07 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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/tmp/tmp.dH9TiQuV7Y/E---3.1_8126.p
% 0.20/0.63 # Version: 3.1pre001
% 0.20/0.63 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.63 # Starting sh5l with 300s (1) cores
% 0.20/0.63 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 8204 completed with status 0
% 0.20/0.63 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.63 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.63 # No SInE strategy applied
% 0.20/0.63 # Search class: FGHSF-FSLM33-SFFFFFNN
% 0.20/0.63 # Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.63 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 271s (1) cores
% 0.20/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.63 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.20/0.63 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.20/0.63 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 0.20/0.63 # G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with pid 8212 completed with status 0
% 0.20/0.63 # Result found by G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S
% 0.20/0.63 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.63 # No SInE strategy applied
% 0.20/0.63 # Search class: FGHSF-FSLM33-SFFFFFNN
% 0.20/0.63 # Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.63 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 271s (1) cores
% 0.20/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.63 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.20/0.63 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.20/0.63 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 0.20/0.63 # Preprocessing time : 0.017 s
% 0.20/0.63 # Presaturation interreduction done
% 0.20/0.63
% 0.20/0.63 # Proof found!
% 0.20/0.63 # SZS status Theorem
% 0.20/0.63 # SZS output start CNFRefutation
% See solution above
% 0.20/0.63 # Parsed axioms : 161
% 0.20/0.63 # Removed by relevancy pruning/SinE : 0
% 0.20/0.63 # Initial clauses : 328
% 0.20/0.63 # Removed in clause preprocessing : 2
% 0.20/0.63 # Initial clauses in saturation : 326
% 0.20/0.63 # Processed clauses : 726
% 0.20/0.63 # ...of these trivial : 22
% 0.20/0.63 # ...subsumed : 3
% 0.20/0.63 # ...remaining for further processing : 701
% 0.20/0.63 # Other redundant clauses eliminated : 1112
% 0.20/0.63 # Clauses deleted for lack of memory : 0
% 0.20/0.63 # Backward-subsumed : 0
% 0.20/0.63 # Backward-rewritten : 2
% 0.20/0.63 # Generated clauses : 371
% 0.20/0.63 # ...of the previous two non-redundant : 364
% 0.20/0.63 # ...aggressively subsumed : 0
% 0.20/0.63 # Contextual simplify-reflections : 4
% 0.20/0.63 # Paramodulations : 120
% 0.20/0.63 # Factorizations : 2
% 0.20/0.63 # NegExts : 0
% 0.20/0.63 # Equation resolutions : 1121
% 0.20/0.63 # Total rewrite steps : 240
% 0.20/0.63 # Propositional unsat checks : 0
% 0.20/0.63 # Propositional check models : 0
% 0.20/0.63 # Propositional check unsatisfiable : 0
% 0.20/0.63 # Propositional clauses : 0
% 0.20/0.63 # Propositional clauses after purity: 0
% 0.20/0.63 # Propositional unsat core size : 0
% 0.20/0.63 # Propositional preprocessing time : 0.000
% 0.20/0.63 # Propositional encoding time : 0.000
% 0.20/0.63 # Propositional solver time : 0.000
% 0.20/0.63 # Success case prop preproc time : 0.000
% 0.20/0.63 # Success case prop encoding time : 0.000
% 0.20/0.63 # Success case prop solver time : 0.000
% 0.20/0.63 # Current number of processed clauses : 158
% 0.20/0.63 # Positive orientable unit clauses : 42
% 0.20/0.63 # Positive unorientable unit clauses: 0
% 0.20/0.63 # Negative unit clauses : 9
% 0.20/0.63 # Non-unit-clauses : 107
% 0.20/0.63 # Current number of unprocessed clauses: 265
% 0.20/0.63 # ...number of literals in the above : 2013
% 0.20/0.63 # Current number of archived formulas : 0
% 0.20/0.63 # Current number of archived clauses : 303
% 0.20/0.63 # Clause-clause subsumption calls (NU) : 94459
% 0.20/0.63 # Rec. Clause-clause subsumption calls : 2886
% 0.20/0.63 # Non-unit clause-clause subsumptions : 6
% 0.20/0.63 # Unit Clause-clause subsumption calls : 27
% 0.20/0.63 # Rewrite failures with RHS unbound : 0
% 0.20/0.63 # BW rewrite match attempts : 2
% 0.20/0.63 # BW rewrite match successes : 2
% 0.20/0.63 # Condensation attempts : 0
% 0.20/0.63 # Condensation successes : 0
% 0.20/0.63 # Termbank termtop insertions : 61220
% 0.20/0.63
% 0.20/0.63 # -------------------------------------------------
% 0.20/0.63 # User time : 0.141 s
% 0.20/0.63 # System time : 0.003 s
% 0.20/0.63 # Total time : 0.144 s
% 0.20/0.63 # Maximum resident set size: 4436 pages
% 0.20/0.63
% 0.20/0.63 # -------------------------------------------------
% 0.20/0.63 # User time : 0.622 s
% 0.20/0.63 # System time : 0.030 s
% 0.20/0.63 # Total time : 0.652 s
% 0.20/0.63 # Maximum resident set size: 2560 pages
% 0.20/0.63 % E---3.1 exiting
% 0.20/0.63 % E---3.1 exiting
%------------------------------------------------------------------------------