TSTP Solution File: GEO274+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO274+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:28 EDT 2023
% Result : Theorem 0.18s 0.68s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 48 ( 26 unt; 0 def)
% Number of atoms : 162 ( 73 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 197 ( 83 ~; 78 |; 30 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 67 ( 0 sgn; 26 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof('qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))',axiom,
! [X369,X370,X371,X372] :
( ( ron(X370,X372)
& ron(X370,X371)
& ron(X369,X372)
& ron(X369,X371)
& ? [X373] :
( X372 = X373
& rline(X373) )
& ? [X374] :
( X371 = X374
& rline(X374) )
& X369 != X370
& ? [X375] :
( X370 = X375
& rpoint(X375) )
& ? [X376] :
( X369 = X376
& rpoint(X376) ) )
=> X371 = X372 ),
file('/export/starexec/sandbox2/tmp/tmp.I0PkwhBZsX/E---3.1_2621.p','qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))') ).
fof('qu(theu(the(227), 1), imp(the(227)))',conjecture,
! [X1] :
( ( ron(vd1089,X1)
& ron(vd1080,X1)
& rline(X1) )
=> X1 = vd1092 ),
file('/export/starexec/sandbox2/tmp/tmp.I0PkwhBZsX/E---3.1_2621.p','qu(theu(the(227), 1), imp(the(227)))') ).
fof('qe(s1(plural(224)))',axiom,
? [X2] :
( vd1080 = X2
& rpoint(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.I0PkwhBZsX/E---3.1_2621.p','qe(s1(plural(224)))') ).
fof('qu(cond(axiom(162), 0), imp(cond(axiom(162), 0)))',axiom,
! [X7,X8] :
( ( ? [X9] :
( X8 = X9
& rpoint(X9) )
& ? [X10] :
( X7 = X10
& rpoint(X10) ) )
=> ( vf(X7,X8) = v0
<=> X7 = X8 ) ),
file('/export/starexec/sandbox2/tmp/tmp.I0PkwhBZsX/E---3.1_2621.p','qu(cond(axiom(162), 0), imp(cond(axiom(162), 0)))') ).
fof('pred(225, 1)',axiom,
rpoint(vd1086),
file('/export/starexec/sandbox2/tmp/tmp.I0PkwhBZsX/E---3.1_2621.p','pred(225, 1)') ).
fof('pred(225, 4)',axiom,
vd1085 = vd1086,
file('/export/starexec/sandbox2/tmp/tmp.I0PkwhBZsX/E---3.1_2621.p','pred(225, 4)') ).
fof('qu(cond(axiom(166), 0), imp(cond(axiom(166), 0)))',axiom,
! [X3,X4] :
( ( ? [X5] :
( X4 = X5
& rpoint(X5) )
& ? [X6] :
( X3 = X6
& rpoint(X6) ) )
=> vf(X3,X4) = vf(X4,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.I0PkwhBZsX/E---3.1_2621.p','qu(cond(axiom(166), 0), imp(cond(axiom(166), 0)))') ).
fof('holds(226, 1090, 1)',axiom,
vf(vd1089,vd1080) = vf(vd1085,vd1080),
file('/export/starexec/sandbox2/tmp/tmp.I0PkwhBZsX/E---3.1_2621.p','holds(226, 1090, 1)') ).
fof('holds(conjunct1(225), 1087, 0)',axiom,
vd1085 != vd1080,
file('/export/starexec/sandbox2/tmp/tmp.I0PkwhBZsX/E---3.1_2621.p','holds(conjunct1(225), 1087, 0)') ).
fof('and(pred(s2(plural(the(227))), 0), and(pred(s1(plural(the(227))), 0), pred(the(227), 0)))',axiom,
( ron(vd1089,vd1092)
& ron(vd1080,vd1092)
& rline(vd1092) ),
file('/export/starexec/sandbox2/tmp/tmp.I0PkwhBZsX/E---3.1_2621.p','and(pred(s2(plural(the(227))), 0), and(pred(s1(plural(the(227))), 0), pred(the(227), 0)))') ).
fof('pred(226, 0)',axiom,
rpoint(vd1089),
file('/export/starexec/sandbox2/tmp/tmp.I0PkwhBZsX/E---3.1_2621.p','pred(226, 0)') ).
fof(c_0_11,plain,
! [X1110,X1111,X1112,X1113,X1114,X1115,X1116,X1117] :
( ~ ron(X1111,X1113)
| ~ ron(X1111,X1112)
| ~ ron(X1110,X1113)
| ~ ron(X1110,X1112)
| X1113 != X1114
| ~ rline(X1114)
| X1112 != X1115
| ~ rline(X1115)
| X1110 = X1111
| X1111 != X1116
| ~ rpoint(X1116)
| X1110 != X1117
| ~ rpoint(X1117)
| X1112 = X1113 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))'])])]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ( ron(vd1089,X1)
& ron(vd1080,X1)
& rline(X1) )
=> X1 = vd1092 ),
inference(assume_negation,[status(cth)],['qu(theu(the(227), 1), imp(the(227)))']) ).
fof(c_0_13,plain,
( vd1080 = esk2_0
& rpoint(esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s1(plural(224)))'])]) ).
fof(c_0_14,plain,
! [X740,X741,X742,X743] :
( ( vf(X740,X741) != v0
| X740 = X741
| X741 != X742
| ~ rpoint(X742)
| X740 != X743
| ~ rpoint(X743) )
& ( X740 != X741
| vf(X740,X741) = v0
| X741 != X742
| ~ rpoint(X742)
| X740 != X743
| ~ rpoint(X743) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(162), 0), imp(cond(axiom(162), 0)))'])])])]) ).
cnf(c_0_15,plain,
( X4 = X1
| X3 = X2
| ~ ron(X1,X2)
| ~ ron(X1,X3)
| ~ ron(X4,X2)
| ~ ron(X4,X3)
| X2 != X5
| ~ rline(X5)
| X3 != X6
| ~ rline(X6)
| X1 != X7
| ~ rpoint(X7)
| X4 != X8
| ~ rpoint(X8) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,negated_conjecture,
( ron(vd1089,esk1_0)
& ron(vd1080,esk1_0)
& rline(esk1_0)
& esk1_0 != vd1092 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
cnf(c_0_17,plain,
rpoint(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
vd1080 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( X1 = X2
| vf(X1,X2) != v0
| X2 != X3
| ~ rpoint(X3)
| X1 != X4
| ~ rpoint(X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
rpoint(vd1086),
inference(split_conjunct,[status(thm)],['pred(225, 1)']) ).
cnf(c_0_21,plain,
vd1085 = vd1086,
inference(split_conjunct,[status(thm)],['pred(225, 4)']) ).
fof(c_0_22,plain,
! [X736,X737,X738,X739] :
( X737 != X738
| ~ rpoint(X738)
| X736 != X739
| ~ rpoint(X739)
| vf(X736,X737) = vf(X737,X736) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(166), 0), imp(cond(axiom(166), 0)))'])])]) ).
cnf(c_0_23,plain,
( X1 = X2
| X3 = X4
| ~ rpoint(X4)
| ~ rpoint(X3)
| ~ rline(X2)
| ~ rline(X1)
| ~ ron(X4,X2)
| ~ ron(X4,X1)
| ~ ron(X3,X2)
| ~ ron(X3,X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_15])])])]) ).
cnf(c_0_24,negated_conjecture,
ron(vd1080,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
rpoint(vd1080),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,negated_conjecture,
rline(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,plain,
( X1 = X2
| vf(X1,X2) != v0
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_19])]) ).
cnf(c_0_28,plain,
vf(vd1089,vd1080) = vf(vd1085,vd1080),
inference(split_conjunct,[status(thm)],['holds(226, 1090, 1)']) ).
cnf(c_0_29,plain,
rpoint(vd1085),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,plain,
vd1085 != vd1080,
inference(split_conjunct,[status(thm)],['holds(conjunct1(225), 1087, 0)']) ).
cnf(c_0_31,plain,
( vf(X3,X1) = vf(X1,X3)
| X1 != X2
| ~ rpoint(X2)
| X3 != X4
| ~ rpoint(X4) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,negated_conjecture,
( X1 = esk1_0
| X2 = vd1080
| ~ rpoint(X2)
| ~ rline(X1)
| ~ ron(vd1080,X1)
| ~ ron(X2,esk1_0)
| ~ ron(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_33,plain,
ron(vd1080,vd1092),
inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(227))), 0), and(pred(s1(plural(the(227))), 0), pred(the(227), 0)))']) ).
cnf(c_0_34,plain,
rline(vd1092),
inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(227))), 0), and(pred(s1(plural(the(227))), 0), pred(the(227), 0)))']) ).
cnf(c_0_35,negated_conjecture,
esk1_0 != vd1092,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_36,plain,
vf(vd1089,vd1080) != v0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_25])]),c_0_30]) ).
cnf(c_0_37,plain,
( vf(X1,X2) = vf(X2,X1)
| ~ rpoint(X2)
| ~ rpoint(X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_31])]) ).
cnf(c_0_38,plain,
rpoint(vd1089),
inference(split_conjunct,[status(thm)],['pred(226, 0)']) ).
cnf(c_0_39,negated_conjecture,
( X1 = vd1080
| ~ rpoint(X1)
| ~ ron(X1,esk1_0)
| ~ ron(X1,vd1092) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),c_0_35]) ).
cnf(c_0_40,negated_conjecture,
ron(vd1089,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_41,plain,
ron(vd1089,vd1092),
inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(227))), 0), and(pred(s1(plural(the(227))), 0), pred(the(227), 0)))']) ).
cnf(c_0_42,plain,
vf(vd1080,vd1089) != v0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_25])]) ).
cnf(c_0_43,negated_conjecture,
vd1089 = vd1080,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_38]),c_0_41])]) ).
cnf(c_0_44,plain,
( vf(X1,X2) = v0
| X1 != X2
| X2 != X3
| ~ rpoint(X3)
| X1 != X4
| ~ rpoint(X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_45,plain,
vf(vd1080,vd1080) != v0,
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
( vf(X1,X1) = v0
| ~ rpoint(X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_44])])]) ).
cnf(c_0_47,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.14 % Problem : GEO274+1 : TPTP v8.1.2. Released v4.1.0.
% 0.06/0.15 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n018.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Oct 3 07:03:39 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.I0PkwhBZsX/E---3.1_2621.p
% 0.18/0.68 # Version: 3.1pre001
% 0.18/0.68 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.68 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.68 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.68 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.68 # Starting sh5l with 300s (1) cores
% 0.18/0.68 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2715 completed with status 0
% 0.18/0.68 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.18/0.68 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.68 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.68 # No SInE strategy applied
% 0.18/0.68 # Search class: FGHSF-FSLM33-SFFFFFNN
% 0.18/0.68 # Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.68 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 271s (1) cores
% 0.18/0.68 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.18/0.68 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.18/0.68 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.18/0.68 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 0.18/0.68 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2722 completed with status 0
% 0.18/0.68 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.18/0.68 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.68 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.68 # No SInE strategy applied
% 0.18/0.68 # Search class: FGHSF-FSLM33-SFFFFFNN
% 0.18/0.68 # Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.68 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 271s (1) cores
% 0.18/0.68 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.18/0.68 # Preprocessing time : 0.017 s
% 0.18/0.68 # Presaturation interreduction done
% 0.18/0.68
% 0.18/0.68 # Proof found!
% 0.18/0.68 # SZS status Theorem
% 0.18/0.68 # SZS output start CNFRefutation
% See solution above
% 0.18/0.68 # Parsed axioms : 117
% 0.18/0.68 # Removed by relevancy pruning/SinE : 0
% 0.18/0.68 # Initial clauses : 270
% 0.18/0.68 # Removed in clause preprocessing : 2
% 0.18/0.68 # Initial clauses in saturation : 268
% 0.18/0.68 # Processed clauses : 808
% 0.18/0.68 # ...of these trivial : 5
% 0.18/0.68 # ...subsumed : 61
% 0.18/0.68 # ...remaining for further processing : 742
% 0.18/0.68 # Other redundant clauses eliminated : 1108
% 0.18/0.68 # Clauses deleted for lack of memory : 0
% 0.18/0.68 # Backward-subsumed : 1
% 0.18/0.68 # Backward-rewritten : 15
% 0.18/0.68 # Generated clauses : 891
% 0.18/0.68 # ...of the previous two non-redundant : 861
% 0.18/0.68 # ...aggressively subsumed : 0
% 0.18/0.68 # Contextual simplify-reflections : 10
% 0.18/0.68 # Paramodulations : 644
% 0.18/0.68 # Factorizations : 0
% 0.18/0.68 # NegExts : 0
% 0.18/0.68 # Equation resolutions : 1109
% 0.18/0.68 # Total rewrite steps : 219
% 0.18/0.68 # Propositional unsat checks : 0
% 0.18/0.68 # Propositional check models : 0
% 0.18/0.68 # Propositional check unsatisfiable : 0
% 0.18/0.68 # Propositional clauses : 0
% 0.18/0.68 # Propositional clauses after purity: 0
% 0.18/0.68 # Propositional unsat core size : 0
% 0.18/0.68 # Propositional preprocessing time : 0.000
% 0.18/0.68 # Propositional encoding time : 0.000
% 0.18/0.68 # Propositional solver time : 0.000
% 0.18/0.68 # Success case prop preproc time : 0.000
% 0.18/0.68 # Success case prop encoding time : 0.000
% 0.18/0.68 # Success case prop solver time : 0.000
% 0.18/0.68 # Current number of processed clauses : 219
% 0.18/0.68 # Positive orientable unit clauses : 20
% 0.18/0.68 # Positive unorientable unit clauses: 0
% 0.18/0.68 # Negative unit clauses : 8
% 0.18/0.68 # Non-unit-clauses : 191
% 0.18/0.68 # Current number of unprocessed clauses: 521
% 0.18/0.68 # ...number of literals in the above : 4370
% 0.18/0.68 # Current number of archived formulas : 0
% 0.18/0.68 # Current number of archived clauses : 282
% 0.18/0.68 # Clause-clause subsumption calls (NU) : 225029
% 0.18/0.68 # Rec. Clause-clause subsumption calls : 8589
% 0.18/0.68 # Non-unit clause-clause subsumptions : 69
% 0.18/0.68 # Unit Clause-clause subsumption calls : 175
% 0.18/0.68 # Rewrite failures with RHS unbound : 0
% 0.18/0.68 # BW rewrite match attempts : 3
% 0.18/0.68 # BW rewrite match successes : 3
% 0.18/0.68 # Condensation attempts : 0
% 0.18/0.68 # Condensation successes : 0
% 0.18/0.68 # Termbank termtop insertions : 67853
% 0.18/0.68
% 0.18/0.68 # -------------------------------------------------
% 0.18/0.68 # User time : 0.189 s
% 0.18/0.68 # System time : 0.011 s
% 0.18/0.68 # Total time : 0.200 s
% 0.18/0.68 # Maximum resident set size: 4216 pages
% 0.18/0.68
% 0.18/0.68 # -------------------------------------------------
% 0.18/0.68 # User time : 0.821 s
% 0.18/0.68 # System time : 0.030 s
% 0.18/0.68 # Total time : 0.851 s
% 0.18/0.68 # Maximum resident set size: 2512 pages
% 0.18/0.68 % E---3.1 exiting
% 0.18/0.68 % E---3.1 exiting
%------------------------------------------------------------------------------