TSTP Solution File: GEO331+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO331+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:38 EDT 2023
% Result : Theorem 0.38s 0.66s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 36 ( 21 unt; 0 def)
% Number of atoms : 137 ( 86 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 162 ( 61 ~; 62 |; 33 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 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 : 51 ( 0 sgn; 21 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof('ass(cond(proof(385), 0), 2)',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,X6),vf(X4,X5)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.TLdYePTK43/E---3.1_7276.p','ass(cond(proof(385), 0), 2)') ).
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/sandbox2/tmp/tmp.TLdYePTK43/E---3.1_7276.p','ass(cond(proof(385), 0), 0)') ).
fof('qe(s1(plural(383)))',axiom,
? [X3] :
( vd1352 = X3
& rpoint(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.TLdYePTK43/E---3.1_7276.p','qe(s1(plural(383)))') ).
fof('qe(s3(plural(383)))',axiom,
? [X1] :
( vd1354 = X1
& rpoint(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.TLdYePTK43/E---3.1_7276.p','qe(s3(plural(383)))') ).
fof('qe(s2(plural(383)))',axiom,
? [X2] :
( vd1353 = X2
& rpoint(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.TLdYePTK43/E---3.1_7276.p','qe(s2(plural(383)))') ).
fof('holds(384, 1360, 0)',conjecture,
vf(vd1352,vd1353) = vf(vd1352,vd1354),
file('/export/starexec/sandbox2/tmp/tmp.TLdYePTK43/E---3.1_7276.p','holds(384, 1360, 0)') ).
fof('holds(383, 1356, 0)',axiom,
vangle(vd1352,vd1353,vd1354) = vangle(vd1352,vd1354,vd1353),
file('/export/starexec/sandbox2/tmp/tmp.TLdYePTK43/E---3.1_7276.p','holds(383, 1356, 0)') ).
fof('pred(383, 8)',axiom,
vd1352 != vd1354,
file('/export/starexec/sandbox2/tmp/tmp.TLdYePTK43/E---3.1_7276.p','pred(383, 8)') ).
fof('pred(383, 7)',axiom,
vd1352 != vd1353,
file('/export/starexec/sandbox2/tmp/tmp.TLdYePTK43/E---3.1_7276.p','pred(383, 7)') ).
fof('pred(383, 9)',axiom,
vd1353 != vd1354,
file('/export/starexec/sandbox2/tmp/tmp.TLdYePTK43/E---3.1_7276.p','pred(383, 9)') ).
fof(c_0_10,plain,
! [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,X6),vf(X4,X5)) ) ),
inference(fof_simplification,[status(thm)],['ass(cond(proof(385), 0), 2)']) ).
fof(c_0_11,plain,
! [X892,X893,X894,X895,X896,X897] :
( vangle(X892,X893,X894) != vangle(X892,X894,X893)
| X893 = X894
| X892 = X894
| X892 = X893
| X894 != X895
| ~ rpoint(X895)
| X893 != X896
| ~ rpoint(X896)
| X892 != X897
| ~ rpoint(X897)
| vf(X892,X893) = vf(X892,X894)
| ~ rless(vf(X892,X894),vf(X892,X893)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_12,plain,
! [X880,X881,X882,X883,X884,X885] :
( vangle(X880,X881,X882) != vangle(X880,X882,X881)
| X881 = X882
| X880 = X882
| X880 = X881
| X882 != X883
| ~ rpoint(X883)
| X881 != X884
| ~ rpoint(X884)
| X880 != X885
| ~ rpoint(X885)
| vf(X880,X881) = vf(X880,X882)
| rless(vf(X880,X881),vf(X880,X882))
| rless(vf(X880,X882),vf(X880,X881)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(proof(385), 0), 0)'])])]) ).
cnf(c_0_13,plain,
( X2 = X3
| X1 = X3
| X1 = X2
| vf(X1,X2) = vf(X1,X3)
| vangle(X1,X2,X3) != vangle(X1,X3,X2)
| X3 != X4
| ~ rpoint(X4)
| X2 != X5
| ~ rpoint(X5)
| X1 != X6
| ~ rpoint(X6)
| ~ rless(vf(X1,X3),vf(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
( vd1352 = esk8_0
& rpoint(esk8_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s1(plural(383)))'])]) ).
fof(c_0_15,plain,
( vd1354 = esk7_0
& rpoint(esk7_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s3(plural(383)))'])]) ).
fof(c_0_16,plain,
( vd1353 = esk9_0
& rpoint(esk9_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s2(plural(383)))'])]) ).
cnf(c_0_17,plain,
( X2 = X3
| X1 = X3
| X1 = X2
| vf(X1,X2) = vf(X1,X3)
| rless(vf(X1,X2),vf(X1,X3))
| rless(vf(X1,X3),vf(X1,X2))
| vangle(X1,X2,X3) != vangle(X1,X3,X2)
| X3 != X4
| ~ rpoint(X4)
| X2 != X5
| ~ rpoint(X5)
| X1 != X6
| ~ rpoint(X6) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( vf(X1,X2) = vf(X1,X3)
| X2 = X3
| X1 = X3
| X1 = X2
| vangle(X1,X2,X3) != vangle(X1,X3,X2)
| ~ rless(vf(X1,X3),vf(X1,X2))
| ~ rpoint(X1)
| ~ rpoint(X2)
| ~ rpoint(X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_13])])]) ).
cnf(c_0_19,plain,
rpoint(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
vd1352 = esk8_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
rpoint(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
vd1354 = esk7_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
rpoint(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
vd1353 = esk9_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_25,negated_conjecture,
vf(vd1352,vd1353) != vf(vd1352,vd1354),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(384, 1360, 0)'])]) ).
cnf(c_0_26,plain,
( vf(X1,X2) = vf(X1,X3)
| X2 = X3
| X1 = X3
| X1 = X2
| vangle(X1,X2,X3) != vangle(X1,X3,X2)
| ~ rpoint(X1)
| ~ rpoint(X2)
| ~ rpoint(X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_17])])]),c_0_18]),c_0_18]) ).
cnf(c_0_27,plain,
vangle(vd1352,vd1353,vd1354) = vangle(vd1352,vd1354,vd1353),
inference(split_conjunct,[status(thm)],['holds(383, 1356, 0)']) ).
cnf(c_0_28,plain,
rpoint(vd1352),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,plain,
rpoint(vd1354),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,plain,
rpoint(vd1353),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
vf(vd1352,vd1353) != vf(vd1352,vd1354),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
vd1352 != vd1354,
inference(split_conjunct,[status(thm)],['pred(383, 8)']) ).
cnf(c_0_33,plain,
vd1352 != vd1353,
inference(split_conjunct,[status(thm)],['pred(383, 7)']) ).
cnf(c_0_34,plain,
vd1353 != vd1354,
inference(split_conjunct,[status(thm)],['pred(383, 9)']) ).
cnf(c_0_35,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_26,c_0_27]),c_0_28]),c_0_29]),c_0_30])]),c_0_31]),c_0_32]),c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : GEO331+1 : TPTP v8.1.2. Released v4.1.0.
% 0.07/0.16 % Command : run_E %s %d THM
% 0.17/0.38 % Computer : n006.cluster.edu
% 0.17/0.38 % Model : x86_64 x86_64
% 0.17/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.38 % Memory : 8042.1875MB
% 0.17/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.38 % CPULimit : 2400
% 0.17/0.38 % WCLimit : 300
% 0.17/0.38 % DateTime : Tue Oct 3 06:54:10 EDT 2023
% 0.17/0.38 % CPUTime :
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.53 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.TLdYePTK43/E---3.1_7276.p
% 0.38/0.66 # Version: 3.1pre001
% 0.38/0.66 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.38/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.66 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.38/0.66 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.66 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.66 # Starting sh5l with 300s (1) cores
% 0.38/0.66 # new_bool_3 with pid 7360 completed with status 0
% 0.38/0.66 # Result found by new_bool_3
% 0.38/0.66 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.38/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.66 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.38/0.66 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.66 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.38/0.66 # Search class: FGHSF-FSLM33-SFFFFFNN
% 0.38/0.66 # Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.66 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 55s (1) cores
% 0.38/0.66 # G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with pid 7363 completed with status 0
% 0.38/0.66 # Result found by G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U
% 0.38/0.66 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.38/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.66 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.38/0.66 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.66 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.38/0.66 # Search class: FGHSF-FSLM33-SFFFFFNN
% 0.38/0.66 # Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.66 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 55s (1) cores
% 0.38/0.66 # Preprocessing time : 0.016 s
% 0.38/0.66 # Presaturation interreduction done
% 0.38/0.66
% 0.38/0.66 # Proof found!
% 0.38/0.66 # SZS status Theorem
% 0.38/0.66 # SZS output start CNFRefutation
% See solution above
% 0.38/0.66 # Parsed axioms : 126
% 0.38/0.66 # Removed by relevancy pruning/SinE : 62
% 0.38/0.66 # Initial clauses : 147
% 0.38/0.66 # Removed in clause preprocessing : 2
% 0.38/0.66 # Initial clauses in saturation : 145
% 0.38/0.66 # Processed clauses : 338
% 0.38/0.66 # ...of these trivial : 0
% 0.38/0.66 # ...subsumed : 1
% 0.38/0.66 # ...remaining for further processing : 337
% 0.38/0.66 # Other redundant clauses eliminated : 836
% 0.38/0.66 # Clauses deleted for lack of memory : 0
% 0.38/0.66 # Backward-subsumed : 1
% 0.38/0.66 # Backward-rewritten : 0
% 0.38/0.66 # Generated clauses : 167
% 0.38/0.66 # ...of the previous two non-redundant : 151
% 0.38/0.66 # ...aggressively subsumed : 0
% 0.38/0.66 # Contextual simplify-reflections : 6
% 0.38/0.66 # Paramodulations : 30
% 0.38/0.66 # Factorizations : 2
% 0.38/0.66 # NegExts : 0
% 0.38/0.66 # Equation resolutions : 837
% 0.38/0.66 # Total rewrite steps : 6
% 0.38/0.66 # Propositional unsat checks : 0
% 0.38/0.66 # Propositional check models : 0
% 0.38/0.66 # Propositional check unsatisfiable : 0
% 0.38/0.66 # Propositional clauses : 0
% 0.38/0.66 # Propositional clauses after purity: 0
% 0.38/0.66 # Propositional unsat core size : 0
% 0.38/0.66 # Propositional preprocessing time : 0.000
% 0.38/0.66 # Propositional encoding time : 0.000
% 0.38/0.66 # Propositional solver time : 0.000
% 0.38/0.66 # Success case prop preproc time : 0.000
% 0.38/0.66 # Success case prop encoding time : 0.000
% 0.38/0.66 # Success case prop solver time : 0.000
% 0.38/0.66 # Current number of processed clauses : 59
% 0.38/0.66 # Positive orientable unit clauses : 7
% 0.38/0.66 # Positive unorientable unit clauses: 0
% 0.38/0.66 # Negative unit clauses : 4
% 0.38/0.66 # Non-unit-clauses : 48
% 0.38/0.66 # Current number of unprocessed clauses: 101
% 0.38/0.66 # ...number of literals in the above : 1343
% 0.38/0.66 # Current number of archived formulas : 0
% 0.38/0.66 # Current number of archived clauses : 144
% 0.38/0.66 # Clause-clause subsumption calls (NU) : 26998
% 0.38/0.66 # Rec. Clause-clause subsumption calls : 579
% 0.38/0.66 # Non-unit clause-clause subsumptions : 8
% 0.38/0.66 # Unit Clause-clause subsumption calls : 6
% 0.38/0.66 # Rewrite failures with RHS unbound : 0
% 0.38/0.66 # BW rewrite match attempts : 0
% 0.38/0.66 # BW rewrite match successes : 0
% 0.38/0.66 # Condensation attempts : 0
% 0.38/0.66 # Condensation successes : 0
% 0.38/0.66 # Termbank termtop insertions : 43903
% 0.38/0.66
% 0.38/0.66 # -------------------------------------------------
% 0.38/0.66 # User time : 0.107 s
% 0.38/0.66 # System time : 0.003 s
% 0.38/0.66 # Total time : 0.110 s
% 0.38/0.66 # Maximum resident set size: 3480 pages
% 0.38/0.66
% 0.38/0.66 # -------------------------------------------------
% 0.38/0.66 # User time : 0.117 s
% 0.38/0.66 # System time : 0.005 s
% 0.38/0.66 # Total time : 0.122 s
% 0.38/0.66 # Maximum resident set size: 2560 pages
% 0.38/0.66 % E---3.1 exiting
% 0.38/0.66 % E---3.1 exiting
%------------------------------------------------------------------------------