TSTP Solution File: GEO275+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO275+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:29 EDT 2023
% Result : Theorem 0.21s 0.64s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 9 unt; 0 def)
% Number of atoms : 80 ( 23 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 98 ( 40 ~; 36 |; 19 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn; 14 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof('qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))',axiom,
! [X608,X609,X610,X611,X612] :
( ( vf(X610,X608) = vf(X610,X609)
& ron(X609,X612)
& ron(X608,X611)
& rcenter(X610,X612)
& rcenter(X610,X611)
& ? [X613] :
( X609 = X613
& rpoint(X613) )
& ? [X614] :
( X608 = X614
& rpoint(X614) ) )
=> X611 = X612 ),
file('/export/starexec/sandbox/tmp/tmp.dPcMuTRhhB/E---3.1_7483.p','qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))') ).
fof('qu(theu(the(228), 1), imp(the(228)))',conjecture,
! [X1] :
( ( ron(vd1081,X1)
& rcenter(vd1080,X1)
& rcircle(X1) )
=> X1 = vd1095 ),
file('/export/starexec/sandbox/tmp/tmp.dPcMuTRhhB/E---3.1_7483.p','qu(theu(the(228), 1), imp(the(228)))') ).
fof('qe(s2(plural(224)))',axiom,
? [X2] :
( vd1081 = X2
& rpoint(X2) ),
file('/export/starexec/sandbox/tmp/tmp.dPcMuTRhhB/E---3.1_7483.p','qe(s2(plural(224)))') ).
fof('and(pred(comma_conjunct2(the(228)), 0), and(pred(comma_conjunct1(the(228)), 0), pred(the(228), 0)))',axiom,
( ron(vd1081,vd1095)
& rcenter(vd1080,vd1095)
& rcircle(vd1095) ),
file('/export/starexec/sandbox/tmp/tmp.dPcMuTRhhB/E---3.1_7483.p','and(pred(comma_conjunct2(the(228)), 0), and(pred(comma_conjunct1(the(228)), 0), pred(the(228), 0)))') ).
fof(c_0_4,plain,
! [X803,X804,X805,X806,X807,X808,X809] :
( vf(X805,X803) != vf(X805,X804)
| ~ ron(X804,X807)
| ~ ron(X803,X806)
| ~ rcenter(X805,X807)
| ~ rcenter(X805,X806)
| X804 != X808
| ~ rpoint(X808)
| X803 != X809
| ~ rpoint(X809)
| X806 = X807 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))'])])]) ).
cnf(c_0_5,plain,
( X5 = X4
| vf(X1,X2) != vf(X1,X3)
| ~ ron(X3,X4)
| ~ ron(X2,X5)
| ~ rcenter(X1,X4)
| ~ rcenter(X1,X5)
| X3 != X6
| ~ rpoint(X6)
| X2 != X7
| ~ rpoint(X7) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ( ron(vd1081,X1)
& rcenter(vd1080,X1)
& rcircle(X1) )
=> X1 = vd1095 ),
inference(assume_negation,[status(cth)],['qu(theu(the(228), 1), imp(the(228)))']) ).
cnf(c_0_7,plain,
( X1 = X2
| vf(X3,X4) != vf(X3,X5)
| ~ rpoint(X4)
| ~ rpoint(X5)
| ~ rcenter(X3,X2)
| ~ rcenter(X3,X1)
| ~ ron(X5,X1)
| ~ ron(X4,X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_5])]) ).
fof(c_0_8,negated_conjecture,
( ron(vd1081,esk1_0)
& rcenter(vd1080,esk1_0)
& rcircle(esk1_0)
& esk1_0 != vd1095 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_9,plain,
( X1 = X2
| ~ rpoint(X3)
| ~ rcenter(X4,X2)
| ~ rcenter(X4,X1)
| ~ ron(X3,X1)
| ~ ron(X3,X2) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
rcenter(vd1080,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
( vd1081 = esk16_0
& rpoint(esk16_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s2(plural(224)))'])]) ).
cnf(c_0_12,negated_conjecture,
( X1 = esk1_0
| ~ rpoint(X2)
| ~ rcenter(vd1080,X1)
| ~ ron(X2,esk1_0)
| ~ ron(X2,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
rcenter(vd1080,vd1095),
inference(split_conjunct,[status(thm)],['and(pred(comma_conjunct2(the(228)), 0), and(pred(comma_conjunct1(the(228)), 0), pred(the(228), 0)))']) ).
cnf(c_0_14,negated_conjecture,
esk1_0 != vd1095,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
rpoint(esk16_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
vd1081 = esk16_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( ~ rpoint(X1)
| ~ ron(X1,esk1_0)
| ~ ron(X1,vd1095) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_18,negated_conjecture,
ron(vd1081,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,plain,
rpoint(vd1081),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
ron(vd1081,vd1095),
inference(split_conjunct,[status(thm)],['and(pred(comma_conjunct2(the(228)), 0), and(pred(comma_conjunct1(the(228)), 0), pred(the(228), 0)))']) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[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])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.16 % Problem : GEO275+1 : TPTP v8.1.2. Released v4.1.0.
% 0.07/0.17 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n013.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Tue Oct 3 06:44:44 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.dPcMuTRhhB/E---3.1_7483.p
% 0.21/0.64 # Version: 3.1pre001
% 0.21/0.64 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.64 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.64 # Starting sh5l with 300s (1) cores
% 0.21/0.64 # new_bool_1 with pid 7565 completed with status 0
% 0.21/0.64 # Result found by new_bool_1
% 0.21/0.64 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.64 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.64 # Search class: FGHSF-FSLM33-SFFFFFNN
% 0.21/0.64 # Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.64 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 55s (1) cores
% 0.21/0.64 # G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with pid 7568 completed with status 0
% 0.21/0.64 # Result found by G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U
% 0.21/0.64 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.64 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.64 # Search class: FGHSF-FSLM33-SFFFFFNN
% 0.21/0.64 # Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.64 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 55s (1) cores
% 0.21/0.64 # Preprocessing time : 0.007 s
% 0.21/0.64 # Presaturation interreduction done
% 0.21/0.64
% 0.21/0.64 # Proof found!
% 0.21/0.64 # SZS status Theorem
% 0.21/0.64 # SZS output start CNFRefutation
% See solution above
% 0.21/0.64 # Parsed axioms : 120
% 0.21/0.64 # Removed by relevancy pruning/SinE : 32
% 0.21/0.64 # Initial clauses : 196
% 0.21/0.64 # Removed in clause preprocessing : 0
% 0.21/0.64 # Initial clauses in saturation : 196
% 0.21/0.64 # Processed clauses : 631
% 0.21/0.64 # ...of these trivial : 0
% 0.21/0.64 # ...subsumed : 29
% 0.21/0.64 # ...remaining for further processing : 602
% 0.21/0.64 # Other redundant clauses eliminated : 539
% 0.21/0.64 # Clauses deleted for lack of memory : 0
% 0.21/0.64 # Backward-subsumed : 1
% 0.21/0.64 # Backward-rewritten : 0
% 0.21/0.64 # Generated clauses : 904
% 0.21/0.64 # ...of the previous two non-redundant : 878
% 0.21/0.64 # ...aggressively subsumed : 0
% 0.21/0.64 # Contextual simplify-reflections : 13
% 0.21/0.64 # Paramodulations : 719
% 0.21/0.64 # Factorizations : 6
% 0.21/0.64 # NegExts : 0
% 0.21/0.64 # Equation resolutions : 544
% 0.21/0.64 # Total rewrite steps : 161
% 0.21/0.64 # Propositional unsat checks : 0
% 0.21/0.64 # Propositional check models : 0
% 0.21/0.64 # Propositional check unsatisfiable : 0
% 0.21/0.64 # Propositional clauses : 0
% 0.21/0.64 # Propositional clauses after purity: 0
% 0.21/0.64 # Propositional unsat core size : 0
% 0.21/0.64 # Propositional preprocessing time : 0.000
% 0.21/0.64 # Propositional encoding time : 0.000
% 0.21/0.64 # Propositional solver time : 0.000
% 0.21/0.64 # Success case prop preproc time : 0.000
% 0.21/0.64 # Success case prop encoding time : 0.000
% 0.21/0.64 # Success case prop solver time : 0.000
% 0.21/0.64 # Current number of processed clauses : 233
% 0.21/0.64 # Positive orientable unit clauses : 15
% 0.21/0.64 # Positive unorientable unit clauses: 0
% 0.21/0.64 # Negative unit clauses : 6
% 0.21/0.64 # Non-unit-clauses : 212
% 0.21/0.64 # Current number of unprocessed clauses: 617
% 0.21/0.64 # ...number of literals in the above : 6165
% 0.21/0.64 # Current number of archived formulas : 0
% 0.21/0.64 # Current number of archived clauses : 195
% 0.21/0.64 # Clause-clause subsumption calls (NU) : 48532
% 0.21/0.64 # Rec. Clause-clause subsumption calls : 2815
% 0.21/0.64 # Non-unit clause-clause subsumptions : 43
% 0.21/0.64 # Unit Clause-clause subsumption calls : 20
% 0.21/0.64 # Rewrite failures with RHS unbound : 0
% 0.21/0.64 # BW rewrite match attempts : 0
% 0.21/0.64 # BW rewrite match successes : 0
% 0.21/0.64 # Condensation attempts : 0
% 0.21/0.64 # Condensation successes : 0
% 0.21/0.64 # Termbank termtop insertions : 50504
% 0.21/0.64
% 0.21/0.64 # -------------------------------------------------
% 0.21/0.64 # User time : 0.100 s
% 0.21/0.64 # System time : 0.004 s
% 0.21/0.64 # Total time : 0.104 s
% 0.21/0.64 # Maximum resident set size: 3628 pages
% 0.21/0.64
% 0.21/0.64 # -------------------------------------------------
% 0.21/0.64 # User time : 0.106 s
% 0.21/0.64 # System time : 0.006 s
% 0.21/0.64 # Total time : 0.111 s
% 0.21/0.64 # Maximum resident set size: 2516 pages
% 0.21/0.64 % E---3.1 exiting
% 0.21/0.64 % E---3.1 exiting
%------------------------------------------------------------------------------