TSTP Solution File: GEO305+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GEO305+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:34:49 EDT 2023
% Result : Theorem 0.15s 0.68s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 28 ( 20 unt; 0 def)
% Number of atoms : 92 ( 30 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 104 ( 40 ~; 32 |; 31 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 10 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn; 13 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof('qu(cond(axiom(83), 0), imp(cond(axiom(83), 0)))',axiom,
! [X4,X5,X6,X7,X8] :
( ( X7 = X8
& ron(X5,X7)
& ron(X4,X7)
& rR(X5,X4,X6)
& rline(X8)
& ? [X9] :
( X6 = X9
& rpoint(X9) )
& ? [X10] :
( X5 = X10
& rpoint(X10) )
& ? [X11] :
( X4 = X11
& rpoint(X11) ) )
=> ron(X6,X7) ),
file('/export/starexec/sandbox2/tmp/tmp.Y2tYSlC1Pe/E---3.1_29690.p','qu(cond(axiom(83), 0), imp(cond(axiom(83), 0)))') ).
fof('and(holds(conjunct2(345), 1294, 0), and(pred(conjunct1(345), 9), and(pred(conjunct1(345), 8), and(pred(conjunct1(345), 7), and(qe(s3(plural(345))), and(qe(s2(plural(345))), qe(s1(plural(345)))))))))',axiom,
( vf(vd1287,vd1288) = vf(vd1287,vd1289)
& vd1288 != vd1289
& vd1287 != vd1289
& vd1287 != vd1288
& ? [X1] :
( vd1289 = X1
& rpoint(X1) )
& ? [X2] :
( vd1288 = X2
& rpoint(X2) )
& ? [X3] :
( vd1287 = X3
& rpoint(X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Y2tYSlC1Pe/E---3.1_29690.p','and(holds(conjunct2(345), 1294, 0), and(pred(conjunct1(345), 9), and(pred(conjunct1(345), 8), and(pred(conjunct1(345), 7), and(qe(s3(plural(345))), and(qe(s2(plural(345))), qe(s1(plural(345)))))))))') ).
fof('and(pred(conjunct2(348), 4), and(holds(conjunct2(348), 1304, 0), and(pred(conjunct2(348), 1), holds(conjunct1(348), 1301, 0))))',axiom,
( vd1302 = vd1303
& rR(vd1289,vd1287,vd1302)
& rpoint(vd1303)
& rR(vd1288,vd1287,vd1299) ),
file('/export/starexec/sandbox2/tmp/tmp.Y2tYSlC1Pe/E---3.1_29690.p','and(pred(conjunct2(348), 4), and(holds(conjunct2(348), 1304, 0), and(pred(conjunct2(348), 1), holds(conjunct1(348), 1301, 0))))') ).
fof('pred(conjunct2(349), 0)',conjecture,
ron(vd1302,vd1297),
file('/export/starexec/sandbox2/tmp/tmp.Y2tYSlC1Pe/E---3.1_29690.p','pred(conjunct2(349), 0)') ).
fof('pred(347, 0)',axiom,
rline(vd1297),
file('/export/starexec/sandbox2/tmp/tmp.Y2tYSlC1Pe/E---3.1_29690.p','pred(347, 0)') ).
fof('pred(s1(plural(347)), 0)',axiom,
ron(vd1287,vd1297),
file('/export/starexec/sandbox2/tmp/tmp.Y2tYSlC1Pe/E---3.1_29690.p','pred(s1(plural(347)), 0)') ).
fof('pred(s2(plural(347)), 0)',axiom,
ron(vd1289,vd1297),
file('/export/starexec/sandbox2/tmp/tmp.Y2tYSlC1Pe/E---3.1_29690.p','pred(s2(plural(347)), 0)') ).
fof(c_0_7,plain,
! [X764,X765,X766,X767,X768,X769,X770,X771] :
( X767 != X768
| ~ ron(X765,X767)
| ~ ron(X764,X767)
| ~ rR(X765,X764,X766)
| ~ rline(X768)
| X766 != X769
| ~ rpoint(X769)
| X765 != X770
| ~ rpoint(X770)
| X764 != X771
| ~ rpoint(X771)
| ron(X766,X767) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(83), 0), imp(cond(axiom(83), 0)))'])])]) ).
fof(c_0_8,plain,
( vf(vd1287,vd1288) = vf(vd1287,vd1289)
& vd1288 != vd1289
& vd1287 != vd1289
& vd1287 != vd1288
& vd1289 = esk1_0
& rpoint(esk1_0)
& vd1288 = esk2_0
& rpoint(esk2_0)
& vd1287 = esk3_0
& rpoint(esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['and(holds(conjunct2(345), 1294, 0), and(pred(conjunct1(345), 9), and(pred(conjunct1(345), 8), and(pred(conjunct1(345), 7), and(qe(s3(plural(345))), and(qe(s2(plural(345))), qe(s1(plural(345)))))))))'])]) ).
cnf(c_0_9,plain,
( ron(X5,X1)
| X1 != X2
| ~ ron(X3,X1)
| ~ ron(X4,X1)
| ~ rR(X3,X4,X5)
| ~ rline(X2)
| X5 != X6
| ~ rpoint(X6)
| X3 != X7
| ~ rpoint(X7)
| X4 != X8
| ~ rpoint(X8) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
rpoint(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
vd1287 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
rpoint(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
vd1289 = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
rpoint(vd1303),
inference(split_conjunct,[status(thm)],['and(pred(conjunct2(348), 4), and(holds(conjunct2(348), 1304, 0), and(pred(conjunct2(348), 1), holds(conjunct1(348), 1301, 0))))']) ).
cnf(c_0_15,plain,
vd1302 = vd1303,
inference(split_conjunct,[status(thm)],['and(pred(conjunct2(348), 4), and(holds(conjunct2(348), 1304, 0), and(pred(conjunct2(348), 1), holds(conjunct1(348), 1301, 0))))']) ).
fof(c_0_16,negated_conjecture,
~ ron(vd1302,vd1297),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['pred(conjunct2(349), 0)'])]) ).
cnf(c_0_17,plain,
( ron(X1,X2)
| ~ rline(X2)
| ~ rpoint(X3)
| ~ rpoint(X4)
| ~ rpoint(X1)
| ~ rR(X4,X3,X1)
| ~ ron(X3,X2)
| ~ ron(X4,X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_18,plain,
rR(vd1289,vd1287,vd1302),
inference(split_conjunct,[status(thm)],['and(pred(conjunct2(348), 4), and(holds(conjunct2(348), 1304, 0), and(pred(conjunct2(348), 1), holds(conjunct1(348), 1301, 0))))']) ).
cnf(c_0_19,plain,
rpoint(vd1287),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_20,plain,
rpoint(vd1289),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_21,plain,
rpoint(vd1302),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,negated_conjecture,
~ ron(vd1302,vd1297),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( ron(vd1302,X1)
| ~ rline(X1)
| ~ ron(vd1287,X1)
| ~ ron(vd1289,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_24,plain,
rline(vd1297),
inference(split_conjunct,[status(thm)],['pred(347, 0)']) ).
cnf(c_0_25,plain,
ron(vd1287,vd1297),
inference(split_conjunct,[status(thm)],['pred(s1(plural(347)), 0)']) ).
cnf(c_0_26,plain,
ron(vd1289,vd1297),
inference(split_conjunct,[status(thm)],['pred(s2(plural(347)), 0)']) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : GEO305+1 : TPTP v8.1.2. Released v4.1.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n024.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 06:48:56 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.43 Running first-order model finding
% 0.15/0.43 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.Y2tYSlC1Pe/E---3.1_29690.p
% 0.15/0.68 # Version: 3.1pre001
% 0.15/0.68 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.68 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.68 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.68 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.68 # Starting sh5l with 300s (1) cores
% 0.15/0.68 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 29769 completed with status 0
% 0.15/0.68 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/0.68 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.68 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.68 # No SInE strategy applied
% 0.15/0.68 # Search class: FGHSF-FSLM33-SFFFFFNN
% 0.15/0.68 # Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.68 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 271s (1) cores
% 0.15/0.68 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/0.68 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.15/0.68 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.15/0.68 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 0.15/0.68 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 29777 completed with status 0
% 0.15/0.68 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/0.68 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.68 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.68 # No SInE strategy applied
% 0.15/0.68 # Search class: FGHSF-FSLM33-SFFFFFNN
% 0.15/0.68 # Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.68 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 271s (1) cores
% 0.15/0.68 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/0.68 # Preprocessing time : 0.018 s
% 0.15/0.68 # Presaturation interreduction done
% 0.15/0.68
% 0.15/0.68 # Proof found!
% 0.15/0.68 # SZS status Theorem
% 0.15/0.68 # SZS output start CNFRefutation
% See solution above
% 0.15/0.68 # Parsed axioms : 125
% 0.15/0.68 # Removed by relevancy pruning/SinE : 0
% 0.15/0.68 # Initial clauses : 292
% 0.15/0.68 # Removed in clause preprocessing : 2
% 0.15/0.68 # Initial clauses in saturation : 290
% 0.15/0.68 # Processed clauses : 805
% 0.15/0.68 # ...of these trivial : 0
% 0.15/0.68 # ...subsumed : 40
% 0.15/0.68 # ...remaining for further processing : 765
% 0.15/0.68 # Other redundant clauses eliminated : 1199
% 0.15/0.68 # Clauses deleted for lack of memory : 0
% 0.15/0.68 # Backward-subsumed : 1
% 0.15/0.68 # Backward-rewritten : 2
% 0.15/0.68 # Generated clauses : 621
% 0.15/0.68 # ...of the previous two non-redundant : 593
% 0.15/0.68 # ...aggressively subsumed : 0
% 0.15/0.68 # Contextual simplify-reflections : 9
% 0.15/0.68 # Paramodulations : 356
% 0.15/0.68 # Factorizations : 0
% 0.15/0.68 # NegExts : 0
% 0.15/0.68 # Equation resolutions : 1200
% 0.15/0.68 # Total rewrite steps : 213
% 0.15/0.68 # Propositional unsat checks : 0
% 0.15/0.68 # Propositional check models : 0
% 0.15/0.68 # Propositional check unsatisfiable : 0
% 0.15/0.68 # Propositional clauses : 0
% 0.15/0.68 # Propositional clauses after purity: 0
% 0.15/0.68 # Propositional unsat core size : 0
% 0.15/0.68 # Propositional preprocessing time : 0.000
% 0.15/0.68 # Propositional encoding time : 0.000
% 0.15/0.68 # Propositional solver time : 0.000
% 0.15/0.68 # Success case prop preproc time : 0.000
% 0.15/0.68 # Success case prop encoding time : 0.000
% 0.15/0.68 # Success case prop solver time : 0.000
% 0.15/0.68 # Current number of processed clauses : 216
% 0.15/0.68 # Positive orientable unit clauses : 29
% 0.15/0.68 # Positive unorientable unit clauses: 0
% 0.15/0.68 # Negative unit clauses : 14
% 0.15/0.68 # Non-unit-clauses : 173
% 0.15/0.68 # Current number of unprocessed clauses: 311
% 0.15/0.68 # ...number of literals in the above : 2512
% 0.15/0.68 # Current number of archived formulas : 0
% 0.15/0.68 # Current number of archived clauses : 291
% 0.15/0.68 # Clause-clause subsumption calls (NU) : 222999
% 0.15/0.68 # Rec. Clause-clause subsumption calls : 4981
% 0.15/0.68 # Non-unit clause-clause subsumptions : 48
% 0.15/0.68 # Unit Clause-clause subsumption calls : 140
% 0.15/0.68 # Rewrite failures with RHS unbound : 0
% 0.15/0.68 # BW rewrite match attempts : 2
% 0.15/0.68 # BW rewrite match successes : 2
% 0.15/0.68 # Condensation attempts : 0
% 0.15/0.68 # Condensation successes : 0
% 0.15/0.68 # Termbank termtop insertions : 67286
% 0.15/0.68
% 0.15/0.68 # -------------------------------------------------
% 0.15/0.68 # User time : 0.219 s
% 0.15/0.68 # System time : 0.010 s
% 0.15/0.68 # Total time : 0.229 s
% 0.15/0.68 # Maximum resident set size: 4424 pages
% 0.15/0.68
% 0.15/0.68 # -------------------------------------------------
% 0.15/0.68 # User time : 0.954 s
% 0.15/0.68 # System time : 0.027 s
% 0.15/0.68 # Total time : 0.980 s
% 0.15/0.68 # Maximum resident set size: 2552 pages
% 0.15/0.68 % E---3.1 exiting
%------------------------------------------------------------------------------