TSTP Solution File: GEO343+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GEO343+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 : Sat May 4 07:45:34 EDT 2024
% Result : Theorem 1.77s 0.66s
% Output : CNFRefutation 1.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 15 unt; 0 def)
% Number of atoms : 146 ( 57 equ)
% Maximal formula atoms : 14 ( 5 avg)
% Number of connectives : 172 ( 55 ~; 44 |; 69 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 10 con; 0-0 aty)
% Number of variables : 47 ( 0 sgn 18 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof('qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))',axiom,
! [X232,X233,X234,X235] :
( ( ron(X233,X235)
& ron(X233,X234)
& ron(X232,X235)
& ron(X232,X234)
& ? [X236] :
( X235 = X236
& rline(X236) )
& ? [X237] :
( X234 = X237
& rline(X237) )
& X232 != X233
& ? [X238] :
( X233 = X238
& rpoint(X238) )
& ? [X239] :
( X232 = X239
& rpoint(X239) ) )
=> X234 = X235 ),
file('/export/starexec/sandbox/tmp/tmp.xBF025sXsz/E---3.1_16986.p','qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))') ).
fof('and(pred(conjunct2(405), 5), and(pred(s2(plural(conjunct2(405))), 0), and(pred(s1(plural(conjunct2(405))), 0), and(pred(conjunct2(405), 1), and(pred(conjunct1(405), 9), and(pred(conjunct1(405), 8), and(pred(conjunct1(405), 7), and(qe(s3(plural(405))), and(qe(s2(plural(405))), qe(s1(plural(405))))))))))))',axiom,
( vd1406 = vd1407
& ron(vd1400,vd1406)
& ron(vd1399,vd1406)
& rline(vd1407)
& vd1400 != vd1401
& vd1399 != vd1401
& vd1399 != vd1400
& ? [X2] :
( vd1401 = X2
& rpoint(X2) )
& ? [X3] :
( vd1400 = X3
& rpoint(X3) )
& ? [X4] :
( vd1399 = X4
& rpoint(X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.xBF025sXsz/E---3.1_16986.p','and(pred(conjunct2(405), 5), and(pred(s2(plural(conjunct2(405))), 0), and(pred(s1(plural(conjunct2(405))), 0), and(pred(conjunct2(405), 1), and(pred(conjunct1(405), 9), and(pred(conjunct1(405), 8), and(pred(conjunct1(405), 7), and(qe(s3(plural(405))), and(qe(s2(plural(405))), qe(s1(plural(405))))))))))))') ).
fof('qu(theu(the(408), 1), imp(the(408)))',conjecture,
! [X1] :
( ( ron(vd1399,X1)
& ron(vd1401,X1)
& rline(X1) )
=> X1 = vd1416 ),
file('/export/starexec/sandbox/tmp/tmp.xBF025sXsz/E---3.1_16986.p','qu(theu(the(408), 1), imp(the(408)))') ).
fof('and(pred(s2(plural(the(408))), 0), and(pred(s1(plural(the(408))), 0), pred(the(408), 0)))',axiom,
( ron(vd1399,vd1416)
& ron(vd1401,vd1416)
& rline(vd1416) ),
file('/export/starexec/sandbox/tmp/tmp.xBF025sXsz/E---3.1_16986.p','and(pred(s2(plural(the(408))), 0), and(pred(s1(plural(the(408))), 0), pred(the(408), 0)))') ).
fof(c_0_4,plain,
! [X232,X233,X234,X235] :
( ( ron(X233,X235)
& ron(X233,X234)
& ron(X232,X235)
& ron(X232,X234)
& ? [X236] :
( X235 = X236
& rline(X236) )
& ? [X237] :
( X234 = X237
& rline(X237) )
& X232 != X233
& ? [X238] :
( X233 = X238
& rpoint(X238) )
& ? [X239] :
( X232 = X239
& rpoint(X239) ) )
=> X234 = X235 ),
inference(fof_simplification,[status(thm)],['qu(cond(axiom(73), 0), imp(cond(axiom(73), 0)))']) ).
fof(c_0_5,plain,
( vd1406 = vd1407
& ron(vd1400,vd1406)
& ron(vd1399,vd1406)
& rline(vd1407)
& vd1400 != vd1401
& vd1399 != vd1401
& vd1399 != vd1400
& ? [X2] :
( vd1401 = X2
& rpoint(X2) )
& ? [X3] :
( vd1400 = X3
& rpoint(X3) )
& ? [X4] :
( vd1399 = X4
& rpoint(X4) ) ),
inference(fof_simplification,[status(thm)],['and(pred(conjunct2(405), 5), and(pred(s2(plural(conjunct2(405))), 0), and(pred(s1(plural(conjunct2(405))), 0), and(pred(conjunct2(405), 1), and(pred(conjunct1(405), 9), and(pred(conjunct1(405), 8), and(pred(conjunct1(405), 7), and(qe(s3(plural(405))), and(qe(s2(plural(405))), qe(s1(plural(405))))))))))))']) ).
fof(c_0_6,plain,
! [X1075,X1076,X1077,X1078,X1079,X1080,X1081,X1082] :
( ~ ron(X1076,X1078)
| ~ ron(X1076,X1077)
| ~ ron(X1075,X1078)
| ~ ron(X1075,X1077)
| X1078 != X1079
| ~ rline(X1079)
| X1077 != X1080
| ~ rline(X1080)
| X1075 = X1076
| X1076 != X1081
| ~ rpoint(X1081)
| X1075 != X1082
| ~ rpoint(X1082)
| X1077 = X1078 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ( ron(vd1399,X1)
& ron(vd1401,X1)
& rline(X1) )
=> X1 = vd1416 ),
inference(assume_negation,[status(cth)],['qu(theu(the(408), 1), imp(the(408)))']) ).
fof(c_0_8,plain,
( vd1406 = vd1407
& ron(vd1400,vd1406)
& ron(vd1399,vd1406)
& rline(vd1407)
& vd1400 != vd1401
& vd1399 != vd1401
& vd1399 != vd1400
& vd1401 = esk2_0
& rpoint(esk2_0)
& vd1400 = esk3_0
& rpoint(esk3_0)
& vd1399 = esk4_0
& rpoint(esk4_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_5])])]) ).
cnf(c_0_9,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_6]) ).
fof(c_0_10,negated_conjecture,
( ron(vd1399,esk1_0)
& ron(vd1401,esk1_0)
& rline(esk1_0)
& esk1_0 != vd1416 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_11,plain,
rpoint(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
vd1401 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,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_9])])])]) ).
cnf(c_0_14,negated_conjecture,
ron(vd1401,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
rpoint(vd1401),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
rline(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
( X1 = esk1_0
| X2 = vd1401
| ~ rpoint(X2)
| ~ rline(X1)
| ~ ron(vd1401,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_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_18,plain,
ron(vd1401,vd1416),
inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(408))), 0), and(pred(s1(plural(the(408))), 0), pred(the(408), 0)))']) ).
cnf(c_0_19,plain,
rline(vd1416),
inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(408))), 0), and(pred(s1(plural(the(408))), 0), pred(the(408), 0)))']) ).
cnf(c_0_20,negated_conjecture,
esk1_0 != vd1416,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,plain,
rpoint(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,plain,
vd1399 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,negated_conjecture,
( X1 = vd1401
| ~ rpoint(X1)
| ~ ron(X1,esk1_0)
| ~ ron(X1,vd1416) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_24,negated_conjecture,
ron(vd1399,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_25,plain,
rpoint(vd1399),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
ron(vd1399,vd1416),
inference(split_conjunct,[status(thm)],['and(pred(s2(plural(the(408))), 0), and(pred(s1(plural(the(408))), 0), pred(the(408), 0)))']) ).
cnf(c_0_27,plain,
vd1399 != vd1401,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[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])]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : GEO343+1 : TPTP v8.1.2. Released v4.1.0.
% 0.04/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n010.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Fri May 3 18:22:37 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.14/0.41 Running first-order model finding
% 0.14/0.41 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.xBF025sXsz/E---3.1_16986.p
% 1.77/0.66 # Version: 3.1.0
% 1.77/0.66 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.77/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.77/0.66 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.77/0.66 # Starting new_bool_3 with 300s (1) cores
% 1.77/0.66 # Starting new_bool_1 with 300s (1) cores
% 1.77/0.66 # Starting sh5l with 300s (1) cores
% 1.77/0.66 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 17063 completed with status 0
% 1.77/0.66 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.77/0.66 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.77/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.77/0.66 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.77/0.66 # No SInE strategy applied
% 1.77/0.66 # Search class: FGHSF-FSLM33-SFFFFFNN
% 1.77/0.66 # Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.77/0.66 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 271s (1) cores
% 1.77/0.66 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.77/0.66 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 1.77/0.66 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 1.77/0.66 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 1.77/0.66 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 17070 completed with status 0
% 1.77/0.66 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.77/0.66 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.77/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.77/0.66 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.77/0.66 # No SInE strategy applied
% 1.77/0.66 # Search class: FGHSF-FSLM33-SFFFFFNN
% 1.77/0.66 # Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.77/0.66 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 271s (1) cores
% 1.77/0.66 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.77/0.66 # Preprocessing time : 0.015 s
% 1.77/0.66 # Presaturation interreduction done
% 1.77/0.66
% 1.77/0.66 # Proof found!
% 1.77/0.66 # SZS status Theorem
% 1.77/0.66 # SZS output start CNFRefutation
% See solution above
% 1.77/0.66 # Parsed axioms : 125
% 1.77/0.66 # Removed by relevancy pruning/SinE : 0
% 1.77/0.66 # Initial clauses : 297
% 1.77/0.66 # Removed in clause preprocessing : 2
% 1.77/0.66 # Initial clauses in saturation : 295
% 1.77/0.66 # Processed clauses : 840
% 1.77/0.66 # ...of these trivial : 9
% 1.77/0.66 # ...subsumed : 38
% 1.77/0.66 # ...remaining for further processing : 793
% 1.77/0.66 # Other redundant clauses eliminated : 1208
% 1.77/0.66 # Clauses deleted for lack of memory : 0
% 1.77/0.66 # Backward-subsumed : 1
% 1.77/0.66 # Backward-rewritten : 7
% 1.77/0.66 # Generated clauses : 783
% 1.77/0.66 # ...of the previous two non-redundant : 754
% 1.77/0.66 # ...aggressively subsumed : 0
% 1.77/0.66 # Contextual simplify-reflections : 8
% 1.77/0.66 # Paramodulations : 519
% 1.77/0.66 # Factorizations : 0
% 1.77/0.66 # NegExts : 0
% 1.77/0.66 # Equation resolutions : 1209
% 1.77/0.66 # Disequality decompositions : 0
% 1.77/0.66 # Total rewrite steps : 257
% 1.77/0.66 # ...of those cached : 226
% 1.77/0.66 # Propositional unsat checks : 0
% 1.77/0.66 # Propositional check models : 0
% 1.77/0.66 # Propositional check unsatisfiable : 0
% 1.77/0.66 # Propositional clauses : 0
% 1.77/0.66 # Propositional clauses after purity: 0
% 1.77/0.66 # Propositional unsat core size : 0
% 1.77/0.66 # Propositional preprocessing time : 0.000
% 1.77/0.66 # Propositional encoding time : 0.000
% 1.77/0.66 # Propositional solver time : 0.000
% 1.77/0.66 # Success case prop preproc time : 0.000
% 1.77/0.66 # Success case prop encoding time : 0.000
% 1.77/0.66 # Success case prop solver time : 0.000
% 1.77/0.66 # Current number of processed clauses : 231
% 1.77/0.66 # Positive orientable unit clauses : 40
% 1.77/0.66 # Positive unorientable unit clauses: 0
% 1.77/0.66 # Negative unit clauses : 10
% 1.77/0.66 # Non-unit-clauses : 181
% 1.77/0.66 # Current number of unprocessed clauses: 419
% 1.77/0.66 # ...number of literals in the above : 3464
% 1.77/0.66 # Current number of archived formulas : 0
% 1.77/0.66 # Current number of archived clauses : 301
% 1.77/0.66 # Clause-clause subsumption calls (NU) : 313164
% 1.77/0.66 # Rec. Clause-clause subsumption calls : 6173
% 1.77/0.66 # Non-unit clause-clause subsumptions : 42
% 1.77/0.66 # Unit Clause-clause subsumption calls : 152
% 1.77/0.66 # Rewrite failures with RHS unbound : 0
% 1.77/0.66 # BW rewrite match attempts : 3
% 1.77/0.66 # BW rewrite match successes : 3
% 1.77/0.66 # Condensation attempts : 0
% 1.77/0.66 # Condensation successes : 0
% 1.77/0.66 # Termbank termtop insertions : 80035
% 1.77/0.66 # Search garbage collected termcells : 15537
% 1.77/0.66
% 1.77/0.66 # -------------------------------------------------
% 1.77/0.66 # User time : 0.226 s
% 1.77/0.66 # System time : 0.008 s
% 1.77/0.66 # Total time : 0.234 s
% 1.77/0.66 # Maximum resident set size: 4576 pages
% 1.77/0.66
% 1.77/0.66 # -------------------------------------------------
% 1.77/0.66 # User time : 1.030 s
% 1.77/0.66 # System time : 0.025 s
% 1.77/0.66 # Total time : 1.054 s
% 1.77/0.66 # Maximum resident set size: 2592 pages
% 1.77/0.66 % E---3.1 exiting
%------------------------------------------------------------------------------