TSTP Solution File: GEO275+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO275+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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:15 EDT 2022
% Result : Theorem 0.25s 1.44s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 13 unt; 0 def)
% Number of atoms : 89 ( 27 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 103 ( 42 ~; 37 |; 21 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
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/solver/bin/../tmp/theBenchmark.p.mepo_128.in','qu(theu(the(228), 1), imp(the(228)))') ).
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/solver/bin/../tmp/theBenchmark.p.mepo_128.in','qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))') ).
fof('qe(s1(plural(224)))',axiom,
? [X3] :
( vd1080 = X3
& rpoint(X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','qe(s1(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/solver/bin/../tmp/theBenchmark.p.mepo_128.in','and(pred(comma_conjunct2(the(228)), 0), and(pred(comma_conjunct1(the(228)), 0), pred(the(228), 0)))') ).
fof('qe(s2(plural(224)))',axiom,
? [X2] :
( vd1081 = X2
& rpoint(X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','qe(s2(plural(224)))') ).
fof(c_0_5,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)))']) ).
fof(c_0_6,plain,
! [X615,X616,X617,X618,X619,X620,X621] :
( vf(X617,X615) != vf(X617,X616)
| ~ ron(X616,X619)
| ~ ron(X615,X618)
| ~ rcenter(X617,X619)
| ~ rcenter(X617,X618)
| X616 != X620
| ~ rpoint(X620)
| X615 != X621
| ~ rpoint(X621)
| X618 = X619 ),
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)],['qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))'])])])])]) ).
fof(c_0_7,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_5])])]) ).
fof(c_0_8,plain,
( vd1080 = esk10_0
& rpoint(esk10_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s1(plural(224)))'])]) ).
cnf(c_0_9,plain,
( X1 = X2
| ~ rpoint(X3)
| X4 != X3
| ~ rpoint(X5)
| X6 != X5
| ~ rcenter(X7,X1)
| ~ rcenter(X7,X2)
| ~ ron(X4,X1)
| ~ ron(X6,X2)
| vf(X7,X4) != vf(X7,X6) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
rcenter(vd1080,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
vd1080 = esk10_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( X1 = X2
| vf(X3,X4) != vf(X3,X5)
| ~ rpoint(X5)
| ~ rpoint(X4)
| ~ rcenter(X3,X2)
| ~ rcenter(X3,X1)
| ~ ron(X5,X2)
| ~ ron(X4,X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_9])]) ).
cnf(c_0_13,negated_conjecture,
rcenter(esk10_0,esk1_0),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,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_15,negated_conjecture,
( X1 = esk1_0
| vf(esk10_0,X2) != vf(esk10_0,X3)
| ~ rpoint(X3)
| ~ rpoint(X2)
| ~ rcenter(esk10_0,X1)
| ~ ron(X3,esk1_0)
| ~ ron(X2,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
rcenter(esk10_0,vd1095),
inference(rw,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
esk1_0 != vd1095,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_18,plain,
( vd1081 = esk16_0
& rpoint(esk16_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s2(plural(224)))'])]) ).
cnf(c_0_19,negated_conjecture,
( vf(esk10_0,X1) != vf(esk10_0,X2)
| ~ rpoint(X2)
| ~ rpoint(X1)
| ~ ron(X2,esk1_0)
| ~ ron(X1,vd1095) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_20,negated_conjecture,
ron(vd1081,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,plain,
vd1081 = esk16_0,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,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_23,negated_conjecture,
( ~ rpoint(X1)
| ~ ron(X1,esk1_0)
| ~ ron(X1,vd1095) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
ron(esk16_0,esk1_0),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
rpoint(esk16_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
ron(esk16_0,vd1095),
inference(rw,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
$false,
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])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO275+1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 18 11:29:39 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.25/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.44 # Preprocessing time : 0.060 s
% 0.25/1.44
% 0.25/1.44 # Proof found!
% 0.25/1.44 # SZS status Theorem
% 0.25/1.44 # SZS output start CNFRefutation
% See solution above
% 0.25/1.44 # Proof object total steps : 28
% 0.25/1.44 # Proof object clause steps : 18
% 0.25/1.44 # Proof object formula steps : 10
% 0.25/1.44 # Proof object conjectures : 12
% 0.25/1.44 # Proof object clause conjectures : 9
% 0.25/1.44 # Proof object formula conjectures : 3
% 0.25/1.44 # Proof object initial clauses used : 9
% 0.25/1.44 # Proof object initial formulas used : 5
% 0.25/1.44 # Proof object generating inferences : 4
% 0.25/1.44 # Proof object simplifying inferences : 10
% 0.25/1.44 # Training examples: 0 positive, 0 negative
% 0.25/1.44 # Parsed axioms : 120
% 0.25/1.44 # Removed by relevancy pruning/SinE : 26
% 0.25/1.44 # Initial clauses : 232
% 0.25/1.44 # Removed in clause preprocessing : 2
% 0.25/1.44 # Initial clauses in saturation : 230
% 0.25/1.44 # Processed clauses : 863
% 0.25/1.44 # ...of these trivial : 0
% 0.25/1.44 # ...subsumed : 356
% 0.25/1.44 # ...remaining for further processing : 507
% 0.25/1.44 # Other redundant clauses eliminated : 1011
% 0.25/1.44 # Clauses deleted for lack of memory : 0
% 0.25/1.44 # Backward-subsumed : 10
% 0.25/1.44 # Backward-rewritten : 3
% 0.25/1.44 # Generated clauses : 1660
% 0.25/1.44 # ...of the previous two non-trivial : 1530
% 0.25/1.44 # Contextual simplify-reflections : 366
% 0.25/1.44 # Paramodulations : 1431
% 0.25/1.44 # Factorizations : 0
% 0.25/1.44 # Equation resolutions : 1032
% 0.25/1.44 # Current number of processed clauses : 286
% 0.25/1.44 # Positive orientable unit clauses : 16
% 0.25/1.44 # Positive unorientable unit clauses: 0
% 0.25/1.44 # Negative unit clauses : 6
% 0.25/1.44 # Non-unit-clauses : 264
% 0.25/1.44 # Current number of unprocessed clauses: 816
% 0.25/1.44 # ...number of literals in the above : 8109
% 0.25/1.44 # Current number of archived formulas : 0
% 0.25/1.44 # Current number of archived clauses : 13
% 0.25/1.44 # Clause-clause subsumption calls (NU) : 37523
% 0.25/1.44 # Rec. Clause-clause subsumption calls : 4831
% 0.25/1.44 # Non-unit clause-clause subsumptions : 714
% 0.25/1.44 # Unit Clause-clause subsumption calls : 48
% 0.25/1.44 # Rewrite failures with RHS unbound : 0
% 0.25/1.44 # BW rewrite match attempts : 3
% 0.25/1.44 # BW rewrite match successes : 3
% 0.25/1.44 # Condensation attempts : 0
% 0.25/1.44 # Condensation successes : 0
% 0.25/1.44 # Termbank termtop insertions : 79666
% 0.25/1.44
% 0.25/1.44 # -------------------------------------------------
% 0.25/1.44 # User time : 0.175 s
% 0.25/1.44 # System time : 0.003 s
% 0.25/1.44 # Total time : 0.178 s
% 0.25/1.44 # Maximum resident set size: 6456 pages
%------------------------------------------------------------------------------