TSTP Solution File: GEO342+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GEO342+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:55 EDT 2023
% Result : Theorem 1.68s 0.65s
% Output : CNFRefutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 9 unt; 0 def)
% Number of atoms : 107 ( 42 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 132 ( 49 ~; 46 |; 36 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 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 : 35 ( 0 sgn; 7 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof('qe(thee(the(408), 1))',conjecture,
? [X1] :
( ron(vd1399,X1)
& ron(vd1401,X1)
& rline(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.MRfv3RX2i7/E---3.1_31303.p','qe(thee(the(408), 1))') ).
fof('qu(cond(axiom(51), 0), imp(cond(axiom(51), 0)))',axiom,
! [X123,X124] :
( ( X123 != X124
& ? [X125] :
( X124 = X125
& rpoint(X125) )
& ? [X126] :
( X123 = X126
& rpoint(X126) ) )
=> ? [X127] :
( ron(X124,X127)
& ron(X123,X127)
& rline(X127) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MRfv3RX2i7/E---3.1_31303.p','qu(cond(axiom(51), 0), imp(cond(axiom(51), 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/sandbox2/tmp/tmp.MRfv3RX2i7/E---3.1_31303.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(c_0_3,negated_conjecture,
~ ? [X1] :
( ron(vd1399,X1)
& ron(vd1401,X1)
& rline(X1) ),
inference(assume_negation,[status(cth)],['qe(thee(the(408), 1))']) ).
fof(c_0_4,plain,
! [X966,X967,X968,X969] :
( ( ron(X967,esk8_2(X966,X967))
| X966 = X967
| X967 != X968
| ~ rpoint(X968)
| X966 != X969
| ~ rpoint(X969) )
& ( ron(X966,esk8_2(X966,X967))
| X966 = X967
| X967 != X968
| ~ rpoint(X968)
| X966 != X969
| ~ rpoint(X969) )
& ( rline(esk8_2(X966,X967))
| X966 = X967
| X967 != X968
| ~ rpoint(X968)
| X966 != X969
| ~ rpoint(X969) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(51), 0), imp(cond(axiom(51), 0)))'])])])])]) ).
fof(c_0_5,plain,
( vd1406 = vd1407
& ron(vd1400,vd1406)
& ron(vd1399,vd1406)
& rline(vd1407)
& vd1400 != vd1401
& vd1399 != vd1401
& vd1399 != vd1400
& vd1401 = esk1_0
& rpoint(esk1_0)
& vd1400 = esk2_0
& rpoint(esk2_0)
& vd1399 = esk3_0
& rpoint(esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[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,negated_conjecture,
! [X778] :
( ~ ron(vd1399,X778)
| ~ ron(vd1401,X778)
| ~ rline(X778) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
cnf(c_0_7,plain,
( ron(X1,esk8_2(X2,X1))
| X2 = X1
| X1 != X3
| ~ rpoint(X3)
| X2 != X4
| ~ rpoint(X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
rpoint(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
vd1399 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( ~ ron(vd1399,X1)
| ~ ron(vd1401,X1)
| ~ rline(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( X1 = X2
| ron(X1,esk8_2(X2,X1))
| ~ rpoint(X2)
| ~ rpoint(X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_7])]) ).
cnf(c_0_12,plain,
rpoint(vd1399),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( ron(X1,esk8_2(X1,X2))
| X1 = X2
| X2 != X3
| ~ rpoint(X3)
| X1 != X4
| ~ rpoint(X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,plain,
rpoint(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
vd1401 = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
( vd1399 = X1
| ~ rpoint(X1)
| ~ rline(esk8_2(X1,vd1399))
| ~ ron(vd1401,esk8_2(X1,vd1399)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_17,plain,
( X1 = X2
| ron(X1,esk8_2(X1,X2))
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_13])]) ).
cnf(c_0_18,plain,
rpoint(vd1401),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
vd1399 != vd1401,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,plain,
( rline(esk8_2(X1,X2))
| X1 = X2
| X2 != X3
| ~ rpoint(X3)
| X1 != X4
| ~ rpoint(X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_21,negated_conjecture,
~ rline(esk8_2(vd1401,vd1399)),
inference(sr,[status(thm)],[inference(cn,[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_12])]),c_0_19]) ).
cnf(c_0_22,plain,
( X1 = X2
| rline(esk8_2(X1,X2))
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_20])]) ).
cnf(c_0_23,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_21,c_0_22]),c_0_18]),c_0_12])]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : GEO342+1 : TPTP v8.1.2. Released v4.1.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n009.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 : 2400
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Tue Oct 3 06:23:14 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.41 Running first-order model finding
% 0.14/0.41 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.MRfv3RX2i7/E---3.1_31303.p
% 1.68/0.65 # Version: 3.1pre001
% 1.68/0.65 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.68/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.68/0.65 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.68/0.65 # Starting new_bool_3 with 300s (1) cores
% 1.68/0.65 # Starting new_bool_1 with 300s (1) cores
% 1.68/0.65 # Starting sh5l with 300s (1) cores
% 1.68/0.65 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 31380 completed with status 0
% 1.68/0.65 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.68/0.65 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.68/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.68/0.65 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.68/0.65 # No SInE strategy applied
% 1.68/0.65 # Search class: FGHSF-FSLM33-SFFFFFNN
% 1.68/0.65 # Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.68/0.65 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 271s (1) cores
% 1.68/0.65 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.68/0.65 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 1.68/0.65 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 1.68/0.65 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 1.68/0.65 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 31387 completed with status 0
% 1.68/0.65 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.68/0.65 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.68/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.68/0.65 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.68/0.65 # No SInE strategy applied
% 1.68/0.65 # Search class: FGHSF-FSLM33-SFFFFFNN
% 1.68/0.65 # Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.68/0.65 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 271s (1) cores
% 1.68/0.65 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.68/0.65 # Preprocessing time : 0.017 s
% 1.68/0.65 # Presaturation interreduction done
% 1.68/0.65
% 1.68/0.65 # Proof found!
% 1.68/0.65 # SZS status Theorem
% 1.68/0.65 # SZS output start CNFRefutation
% See solution above
% 1.68/0.65 # Parsed axioms : 124
% 1.68/0.65 # Removed by relevancy pruning/SinE : 0
% 1.68/0.65 # Initial clauses : 291
% 1.68/0.65 # Removed in clause preprocessing : 2
% 1.68/0.65 # Initial clauses in saturation : 289
% 1.68/0.65 # Processed clauses : 695
% 1.68/0.65 # ...of these trivial : 5
% 1.68/0.65 # ...subsumed : 6
% 1.68/0.65 # ...remaining for further processing : 684
% 1.68/0.65 # Other redundant clauses eliminated : 1208
% 1.68/0.65 # Clauses deleted for lack of memory : 0
% 1.68/0.65 # Backward-subsumed : 0
% 1.68/0.65 # Backward-rewritten : 2
% 1.68/0.65 # Generated clauses : 364
% 1.68/0.65 # ...of the previous two non-redundant : 353
% 1.68/0.65 # ...aggressively subsumed : 0
% 1.68/0.65 # Contextual simplify-reflections : 8
% 1.68/0.65 # Paramodulations : 100
% 1.68/0.65 # Factorizations : 0
% 1.68/0.65 # NegExts : 0
% 1.68/0.65 # Equation resolutions : 1209
% 1.68/0.65 # Total rewrite steps : 82
% 1.68/0.65 # Propositional unsat checks : 0
% 1.68/0.65 # Propositional check models : 0
% 1.68/0.65 # Propositional check unsatisfiable : 0
% 1.68/0.65 # Propositional clauses : 0
% 1.68/0.65 # Propositional clauses after purity: 0
% 1.68/0.65 # Propositional unsat core size : 0
% 1.68/0.65 # Propositional preprocessing time : 0.000
% 1.68/0.65 # Propositional encoding time : 0.000
% 1.68/0.65 # Propositional solver time : 0.000
% 1.68/0.65 # Success case prop preproc time : 0.000
% 1.68/0.65 # Success case prop encoding time : 0.000
% 1.68/0.65 # Success case prop solver time : 0.000
% 1.68/0.65 # Current number of processed clauses : 134
% 1.68/0.65 # Positive orientable unit clauses : 28
% 1.68/0.65 # Positive unorientable unit clauses: 0
% 1.68/0.65 # Negative unit clauses : 9
% 1.68/0.65 # Non-unit-clauses : 97
% 1.68/0.65 # Current number of unprocessed clauses: 221
% 1.68/0.65 # ...number of literals in the above : 2108
% 1.68/0.65 # Current number of archived formulas : 0
% 1.68/0.65 # Current number of archived clauses : 289
% 1.68/0.65 # Clause-clause subsumption calls (NU) : 240169
% 1.68/0.65 # Rec. Clause-clause subsumption calls : 4558
% 1.68/0.65 # Non-unit clause-clause subsumptions : 13
% 1.68/0.65 # Unit Clause-clause subsumption calls : 56
% 1.68/0.65 # Rewrite failures with RHS unbound : 0
% 1.68/0.65 # BW rewrite match attempts : 1
% 1.68/0.65 # BW rewrite match successes : 1
% 1.68/0.65 # Condensation attempts : 0
% 1.68/0.65 # Condensation successes : 0
% 1.68/0.65 # Termbank termtop insertions : 63589
% 1.68/0.65
% 1.68/0.65 # -------------------------------------------------
% 1.68/0.65 # User time : 0.210 s
% 1.68/0.65 # System time : 0.003 s
% 1.68/0.65 # Total time : 0.213 s
% 1.68/0.65 # Maximum resident set size: 4468 pages
% 1.68/0.65
% 1.68/0.65 # -------------------------------------------------
% 1.68/0.65 # User time : 0.923 s
% 1.68/0.65 # System time : 0.022 s
% 1.68/0.65 # Total time : 0.944 s
% 1.68/0.65 # Maximum resident set size: 2568 pages
% 1.68/0.65 % E---3.1 exiting
%------------------------------------------------------------------------------