TSTP Solution File: GEO331+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO331+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n022.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 : 600s
% DateTime : Sat Jul 16 04:05:27 EDT 2022
% Result : Theorem 0.27s 1.44s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 41 ( 27 unt; 0 def)
% Number of atoms : 131 ( 87 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 154 ( 64 ~; 62 |; 24 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-3 aty)
% Number of variables : 45 ( 0 sgn 18 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof('holds(384, 1360, 0)',conjecture,
vf(vd1352,vd1353) = vf(vd1352,vd1354),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(384, 1360, 0)') ).
fof('ass(cond(proof(385), 0), 1)',axiom,
! [X4,X5,X6] :
( ( vangle(X4,X5,X6) = vangle(X4,X6,X5)
& X5 != X6
& X4 != X6
& X4 != X5
& ? [X7] :
( X6 = X7
& rpoint(X7) )
& ? [X8] :
( X5 = X8
& rpoint(X8) )
& ? [X9] :
( X4 = X9
& rpoint(X9) ) )
=> ( vf(X4,X5) != vf(X4,X6)
=> ~ rless(vf(X4,X5),vf(X4,X6)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(proof(385), 0), 1)') ).
fof('qe(s3(plural(383)))',axiom,
? [X1] :
( vd1354 = X1
& rpoint(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','qe(s3(plural(383)))') ).
fof('ass(cond(proof(385), 0), 0)',axiom,
! [X4,X5,X6] :
( ( vangle(X4,X5,X6) = vangle(X4,X6,X5)
& X5 != X6
& X4 != X6
& X4 != X5
& ? [X7] :
( X6 = X7
& rpoint(X7) )
& ? [X8] :
( X5 = X8
& rpoint(X8) )
& ? [X9] :
( X4 = X9
& rpoint(X9) ) )
=> ( vf(X4,X5) != vf(X4,X6)
=> ( rless(vf(X4,X5),vf(X4,X6))
| rless(vf(X4,X6),vf(X4,X5)) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','ass(cond(proof(385), 0), 0)') ).
fof('qe(s1(plural(383)))',axiom,
? [X3] :
( vd1352 = X3
& rpoint(X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','qe(s1(plural(383)))') ).
fof('qe(s2(plural(383)))',axiom,
? [X2] :
( vd1353 = X2
& rpoint(X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','qe(s2(plural(383)))') ).
fof('pred(383, 9)',axiom,
vd1353 != vd1354,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','pred(383, 9)') ).
fof('pred(383, 8)',axiom,
vd1352 != vd1354,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','pred(383, 8)') ).
fof('holds(383, 1356, 0)',axiom,
vangle(vd1352,vd1353,vd1354) = vangle(vd1352,vd1354,vd1353),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(383, 1356, 0)') ).
fof('pred(383, 7)',axiom,
vd1352 != vd1353,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','pred(383, 7)') ).
fof(c_0_10,negated_conjecture,
vf(vd1352,vd1353) != vf(vd1352,vd1354),
inference(assume_negation,[status(cth)],['holds(384, 1360, 0)']) ).
fof(c_0_11,plain,
! [X10,X11,X12,X13,X14,X15] :
( vangle(X10,X11,X12) != vangle(X10,X12,X11)
| X11 = X12
| X10 = X12
| X10 = X11
| X12 != X13
| ~ rpoint(X13)
| X11 != X14
| ~ rpoint(X14)
| X10 != X15
| ~ rpoint(X15)
| vf(X10,X11) = vf(X10,X12)
| ~ rless(vf(X10,X11),vf(X10,X12)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],['ass(cond(proof(385), 0), 1)'])])])])])]) ).
fof(c_0_12,negated_conjecture,
vf(vd1352,vd1353) != vf(vd1352,vd1354),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
( vd1354 = esk7_0
& rpoint(esk7_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s3(plural(383)))'])]) ).
fof(c_0_14,plain,
! [X10,X11,X12,X13,X14,X15] :
( vangle(X10,X11,X12) != vangle(X10,X12,X11)
| X11 = X12
| X10 = X12
| X10 = X11
| X12 != X13
| ~ rpoint(X13)
| X11 != X14
| ~ rpoint(X14)
| X10 != X15
| ~ rpoint(X15)
| vf(X10,X11) = vf(X10,X12)
| rless(vf(X10,X11),vf(X10,X12))
| rless(vf(X10,X12),vf(X10,X11)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(proof(385), 0), 0)'])])])])]) ).
cnf(c_0_15,plain,
( vf(X1,X2) = vf(X1,X3)
| X1 = X2
| X1 = X3
| X2 = X3
| ~ rless(vf(X1,X2),vf(X1,X3))
| ~ rpoint(X4)
| X1 != X4
| ~ rpoint(X5)
| X2 != X5
| ~ rpoint(X6)
| X3 != X6
| vangle(X1,X2,X3) != vangle(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
( vd1352 = esk8_0
& rpoint(esk8_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s1(plural(383)))'])]) ).
fof(c_0_17,plain,
( vd1353 = esk9_0
& rpoint(esk9_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s2(plural(383)))'])]) ).
cnf(c_0_18,negated_conjecture,
vf(vd1352,vd1353) != vf(vd1352,vd1354),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
vd1354 = esk7_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
vd1353 != vd1354,
inference(split_conjunct,[status(thm)],['pred(383, 9)']) ).
cnf(c_0_21,plain,
vd1352 != vd1354,
inference(split_conjunct,[status(thm)],['pred(383, 8)']) ).
cnf(c_0_22,plain,
( rless(vf(X1,X2),vf(X1,X3))
| rless(vf(X1,X3),vf(X1,X2))
| vf(X1,X3) = vf(X1,X2)
| X1 = X3
| X1 = X2
| X3 = X2
| ~ rpoint(X4)
| X1 != X4
| ~ rpoint(X5)
| X3 != X5
| ~ rpoint(X6)
| X2 != X6
| vangle(X1,X3,X2) != vangle(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( vf(X1,X2) = vf(X1,X3)
| X2 = X3
| X1 = X3
| X1 = X2
| vangle(X1,X2,X3) != vangle(X1,X3,X2)
| ~ rless(vf(X1,X2),vf(X1,X3))
| ~ rpoint(X3)
| ~ rpoint(X2)
| ~ rpoint(X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_15])])]) ).
cnf(c_0_24,plain,
vangle(vd1352,vd1353,vd1354) = vangle(vd1352,vd1354,vd1353),
inference(split_conjunct,[status(thm)],['holds(383, 1356, 0)']) ).
cnf(c_0_25,plain,
vd1352 = esk8_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
vd1353 = esk9_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,negated_conjecture,
vf(vd1352,vd1353) != vf(vd1352,esk7_0),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_28,plain,
vd1353 != esk7_0,
inference(rw,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_29,plain,
vd1352 != esk7_0,
inference(rw,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_30,plain,
vd1352 != vd1353,
inference(split_conjunct,[status(thm)],['pred(383, 7)']) ).
cnf(c_0_31,plain,
( vf(X1,X2) = vf(X1,X3)
| X2 = X3
| X1 = X3
| X1 = X2
| vangle(X1,X2,X3) != vangle(X1,X3,X2)
| ~ rpoint(X2)
| ~ rpoint(X3)
| ~ rpoint(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_22])])]),c_0_23]),c_0_23]) ).
cnf(c_0_32,plain,
vangle(esk8_0,esk7_0,esk9_0) = vangle(esk8_0,esk9_0,esk7_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_24,c_0_25]),c_0_26]),c_0_19]),c_0_25]),c_0_19]),c_0_26]) ).
cnf(c_0_33,plain,
rpoint(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_34,plain,
rpoint(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_35,plain,
rpoint(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_36,negated_conjecture,
vf(esk8_0,esk7_0) != vf(esk8_0,esk9_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_25]),c_0_25]),c_0_26]) ).
cnf(c_0_37,plain,
esk7_0 != esk9_0,
inference(rw,[status(thm)],[c_0_28,c_0_26]) ).
cnf(c_0_38,plain,
esk7_0 != esk8_0,
inference(rw,[status(thm)],[c_0_29,c_0_25]) ).
cnf(c_0_39,plain,
esk9_0 != esk8_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_25]),c_0_26]) ).
cnf(c_0_40,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]),c_0_35])]),c_0_36]),c_0_37]),c_0_38]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO331+1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n022.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jun 18 15:57:02 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.27/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.27/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.27/1.44 # Preprocessing time : 0.059 s
% 0.27/1.44
% 0.27/1.44 # Proof found!
% 0.27/1.44 # SZS status Theorem
% 0.27/1.44 # SZS output start CNFRefutation
% See solution above
% 0.27/1.44 # Proof object total steps : 41
% 0.27/1.44 # Proof object clause steps : 24
% 0.27/1.44 # Proof object formula steps : 17
% 0.27/1.44 # Proof object conjectures : 6
% 0.27/1.44 # Proof object clause conjectures : 3
% 0.27/1.44 # Proof object formula conjectures : 3
% 0.27/1.44 # Proof object initial clauses used : 13
% 0.27/1.44 # Proof object initial formulas used : 10
% 0.27/1.44 # Proof object generating inferences : 1
% 0.27/1.44 # Proof object simplifying inferences : 32
% 0.27/1.44 # Training examples: 0 positive, 0 negative
% 0.27/1.44 # Parsed axioms : 126
% 0.27/1.44 # Removed by relevancy pruning/SinE : 34
% 0.27/1.44 # Initial clauses : 208
% 0.27/1.44 # Removed in clause preprocessing : 2
% 0.27/1.44 # Initial clauses in saturation : 206
% 0.27/1.44 # Processed clauses : 696
% 0.27/1.44 # ...of these trivial : 0
% 0.27/1.44 # ...subsumed : 284
% 0.27/1.44 # ...remaining for further processing : 412
% 0.27/1.44 # Other redundant clauses eliminated : 1014
% 0.27/1.44 # Clauses deleted for lack of memory : 0
% 0.27/1.44 # Backward-subsumed : 4
% 0.27/1.44 # Backward-rewritten : 4
% 0.27/1.44 # Generated clauses : 1132
% 0.27/1.44 # ...of the previous two non-trivial : 1097
% 0.27/1.44 # Contextual simplify-reflections : 194
% 0.27/1.44 # Paramodulations : 936
% 0.27/1.44 # Factorizations : 0
% 0.27/1.44 # Equation resolutions : 1020
% 0.27/1.44 # Current number of processed clauses : 214
% 0.27/1.44 # Positive orientable unit clauses : 7
% 0.27/1.44 # Positive unorientable unit clauses: 0
% 0.27/1.44 # Negative unit clauses : 4
% 0.27/1.44 # Non-unit-clauses : 203
% 0.27/1.44 # Current number of unprocessed clauses: 573
% 0.27/1.44 # ...number of literals in the above : 5618
% 0.27/1.44 # Current number of archived formulas : 0
% 0.27/1.44 # Current number of archived clauses : 8
% 0.27/1.44 # Clause-clause subsumption calls (NU) : 50307
% 0.27/1.44 # Rec. Clause-clause subsumption calls : 3945
% 0.27/1.44 # Non-unit clause-clause subsumptions : 482
% 0.27/1.44 # Unit Clause-clause subsumption calls : 17
% 0.27/1.44 # Rewrite failures with RHS unbound : 0
% 0.27/1.44 # BW rewrite match attempts : 2
% 0.27/1.44 # BW rewrite match successes : 2
% 0.27/1.44 # Condensation attempts : 0
% 0.27/1.44 # Condensation successes : 0
% 0.27/1.44 # Termbank termtop insertions : 71089
% 0.27/1.44
% 0.27/1.44 # -------------------------------------------------
% 0.27/1.44 # User time : 0.131 s
% 0.27/1.44 # System time : 0.005 s
% 0.27/1.44 # Total time : 0.137 s
% 0.27/1.44 # Maximum resident set size: 5948 pages
% 0.27/23.44 eprover: CPU time limit exceeded, terminating
% 0.27/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.45 eprover: No such file or directory
% 0.27/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.46 eprover: No such file or directory
% 0.27/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.47 eprover: No such file or directory
% 0.27/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.47 eprover: No such file or directory
% 0.27/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.48 eprover: No such file or directory
% 0.27/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.48 eprover: No such file or directory
% 0.27/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.49 eprover: No such file or directory
% 0.27/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.50 eprover: No such file or directory
% 0.27/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.50 eprover: No such file or directory
% 0.27/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.51 eprover: No such file or directory
% 0.27/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.51 eprover: No such file or directory
%------------------------------------------------------------------------------