TSTP Solution File: GEO271+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GEO271+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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:42:43 EDT 2024
% Result : Theorem 1.68s 0.77s
% Output : CNFRefutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 9 unt; 0 def)
% Number of atoms : 91 ( 30 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 111 ( 43 ~; 36 |; 29 &)
% ( 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 : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn 14 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof('qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))',axiom,
! [X136,X137,X138,X139,X140] :
( ( vf(X138,X136) = vf(X138,X137)
& ron(X137,X140)
& ron(X136,X139)
& rcenter(X138,X140)
& rcenter(X138,X139)
& ? [X141] :
( X137 = X141
& rpoint(X141) )
& ? [X142] :
( X136 = X142
& rpoint(X142) ) )
=> X139 = X140 ),
file('/export/starexec/sandbox2/tmp/tmp.REGRLfFsRX/E---3.1_2680.p','qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))') ).
fof('qu(theu(the(211), 1), imp(the(211)))',conjecture,
! [X1] :
( ( ron(vd1057,X1)
& rcenter(vd1055,X1)
& rcircle(X1) )
=> X1 = vd1061 ),
file('/export/starexec/sandbox2/tmp/tmp.REGRLfFsRX/E---3.1_2680.p','qu(theu(the(211), 1), imp(the(211)))') ).
fof('and(pred(conjunct2(210), 4), and(holds(conjunct2(210), 1059, 0), and(pred(conjunct2(210), 1), and(pred(conjunct1(210), 2), pred(conjunct1(210), 1)))))',axiom,
( vd1057 = vd1058
& vd1055 != vd1057
& rpoint(vd1058)
& vd1055 = vd1056
& rpoint(vd1056) ),
file('/export/starexec/sandbox2/tmp/tmp.REGRLfFsRX/E---3.1_2680.p','and(pred(conjunct2(210), 4), and(holds(conjunct2(210), 1059, 0), and(pred(conjunct2(210), 1), and(pred(conjunct1(210), 2), pred(conjunct1(210), 1)))))') ).
fof('and(pred(comma_conjunct2(the(211)), 0), and(pred(comma_conjunct1(the(211)), 0), pred(the(211), 0)))',axiom,
( ron(vd1057,vd1061)
& rcenter(vd1055,vd1061)
& rcircle(vd1061) ),
file('/export/starexec/sandbox2/tmp/tmp.REGRLfFsRX/E---3.1_2680.p','and(pred(comma_conjunct2(the(211)), 0), and(pred(comma_conjunct1(the(211)), 0), pred(the(211), 0)))') ).
fof(c_0_4,plain,
! [X903,X904,X905,X906,X907,X908,X909] :
( vf(X905,X903) != vf(X905,X904)
| ~ ron(X904,X907)
| ~ ron(X903,X906)
| ~ rcenter(X905,X907)
| ~ rcenter(X905,X906)
| X904 != X908
| ~ rpoint(X908)
| X903 != X909
| ~ rpoint(X909)
| X906 = X907 ),
inference(fof_nnf,[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)))'])])])]) ).
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(vd1057,X1)
& rcenter(vd1055,X1)
& rcircle(X1) )
=> X1 = vd1061 ),
inference(assume_negation,[status(cth)],['qu(theu(the(211), 1), imp(the(211)))']) ).
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(vd1057,esk1_0)
& rcenter(vd1055,esk1_0)
& rcircle(esk1_0)
& esk1_0 != vd1061 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_9,plain,
( vd1057 = vd1058
& vd1055 != vd1057
& rpoint(vd1058)
& vd1055 = vd1056
& rpoint(vd1056) ),
inference(fof_simplification,[status(thm)],['and(pred(conjunct2(210), 4), and(holds(conjunct2(210), 1059, 0), and(pred(conjunct2(210), 1), and(pred(conjunct1(210), 2), pred(conjunct1(210), 1)))))']) ).
cnf(c_0_10,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_11,negated_conjecture,
rcenter(vd1055,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
( vd1057 = vd1058
& vd1055 != vd1057
& rpoint(vd1058)
& vd1055 = vd1056
& rpoint(vd1056) ),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( X1 = esk1_0
| ~ rpoint(X2)
| ~ rcenter(vd1055,X1)
| ~ ron(X2,esk1_0)
| ~ ron(X2,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
rcenter(vd1055,vd1061),
inference(split_conjunct,[status(thm)],['and(pred(comma_conjunct2(the(211)), 0), and(pred(comma_conjunct1(the(211)), 0), pred(the(211), 0)))']) ).
cnf(c_0_15,negated_conjecture,
esk1_0 != vd1061,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
rpoint(vd1058),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
vd1057 = vd1058,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( ~ rpoint(X1)
| ~ ron(X1,esk1_0)
| ~ ron(X1,vd1061) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_19,negated_conjecture,
ron(vd1057,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,plain,
rpoint(vd1057),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
ron(vd1057,vd1061),
inference(split_conjunct,[status(thm)],['and(pred(comma_conjunct2(the(211)), 0), and(pred(comma_conjunct1(the(211)), 0), pred(the(211), 0)))']) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : GEO271+1 : TPTP v8.1.2. Released v4.1.0.
% 0.07/0.16 % Command : run_E %s %d THM
% 0.16/0.38 % Computer : n009.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Fri May 3 18:51:38 EDT 2024
% 0.16/0.38 % CPUTime :
% 0.23/0.54 Running first-order theorem proving
% 0.23/0.54 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.REGRLfFsRX/E---3.1_2680.p
% 1.68/0.77 # Version: 3.1.0
% 1.68/0.77 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.68/0.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.68/0.77 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.68/0.77 # Starting new_bool_3 with 300s (1) cores
% 1.68/0.77 # Starting new_bool_1 with 300s (1) cores
% 1.68/0.77 # Starting sh5l with 300s (1) cores
% 1.68/0.77 # sh5l with pid 2799 completed with status 0
% 1.68/0.77 # Result found by sh5l
% 1.68/0.77 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.68/0.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.68/0.77 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.68/0.77 # Starting new_bool_3 with 300s (1) cores
% 1.68/0.77 # Starting new_bool_1 with 300s (1) cores
% 1.68/0.77 # Starting sh5l with 300s (1) cores
% 1.68/0.77 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.68/0.77 # Search class: FGHSF-FSLM33-SFFFFFNN
% 1.68/0.77 # Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 1.68/0.77 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 55s (1) cores
% 1.68/0.77 # G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with pid 2830 completed with status 0
% 1.68/0.77 # Result found by G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U
% 1.68/0.77 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.68/0.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.68/0.77 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.68/0.77 # Starting new_bool_3 with 300s (1) cores
% 1.68/0.77 # Starting new_bool_1 with 300s (1) cores
% 1.68/0.77 # Starting sh5l with 300s (1) cores
% 1.68/0.77 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.68/0.77 # Search class: FGHSF-FSLM33-SFFFFFNN
% 1.68/0.77 # Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 1.68/0.77 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 55s (1) cores
% 1.68/0.77 # Preprocessing time : 0.016 s
% 1.68/0.77 # Presaturation interreduction done
% 1.68/0.77
% 1.68/0.77 # Proof found!
% 1.68/0.77 # SZS status Theorem
% 1.68/0.77 # SZS output start CNFRefutation
% See solution above
% 1.68/0.77 # Parsed axioms : 105
% 1.68/0.77 # Removed by relevancy pruning/SinE : 3
% 1.68/0.77 # Initial clauses : 249
% 1.68/0.77 # Removed in clause preprocessing : 2
% 1.68/0.77 # Initial clauses in saturation : 247
% 1.68/0.77 # Processed clauses : 766
% 1.68/0.77 # ...of these trivial : 0
% 1.68/0.77 # ...subsumed : 18
% 1.68/0.77 # ...remaining for further processing : 748
% 1.68/0.77 # Other redundant clauses eliminated : 1082
% 1.68/0.77 # Clauses deleted for lack of memory : 0
% 1.68/0.77 # Backward-subsumed : 2
% 1.68/0.77 # Backward-rewritten : 2
% 1.68/0.77 # Generated clauses : 1739
% 1.68/0.77 # ...of the previous two non-redundant : 1707
% 1.68/0.77 # ...aggressively subsumed : 0
% 1.68/0.77 # Contextual simplify-reflections : 10
% 1.68/0.77 # Paramodulations : 1493
% 1.68/0.77 # Factorizations : 8
% 1.68/0.77 # NegExts : 0
% 1.68/0.77 # Equation resolutions : 1092
% 1.68/0.77 # Disequality decompositions : 0
% 1.68/0.77 # Total rewrite steps : 200
% 1.68/0.77 # ...of those cached : 190
% 1.68/0.77 # Propositional unsat checks : 0
% 1.68/0.77 # Propositional check models : 0
% 1.68/0.77 # Propositional check unsatisfiable : 0
% 1.68/0.77 # Propositional clauses : 0
% 1.68/0.77 # Propositional clauses after purity: 0
% 1.68/0.77 # Propositional unsat core size : 0
% 1.68/0.77 # Propositional preprocessing time : 0.000
% 1.68/0.77 # Propositional encoding time : 0.000
% 1.68/0.77 # Propositional solver time : 0.000
% 1.68/0.77 # Success case prop preproc time : 0.000
% 1.68/0.77 # Success case prop encoding time : 0.000
% 1.68/0.77 # Success case prop solver time : 0.000
% 1.68/0.77 # Current number of processed clauses : 271
% 1.68/0.77 # Positive orientable unit clauses : 15
% 1.68/0.77 # Positive unorientable unit clauses: 0
% 1.68/0.77 # Negative unit clauses : 4
% 1.68/0.77 # Non-unit-clauses : 252
% 1.68/0.77 # Current number of unprocessed clauses: 1398
% 1.68/0.77 # ...number of literals in the above : 24474
% 1.68/0.77 # Current number of archived formulas : 0
% 1.68/0.77 # Current number of archived clauses : 249
% 1.68/0.77 # Clause-clause subsumption calls (NU) : 109247
% 1.68/0.77 # Rec. Clause-clause subsumption calls : 3163
% 1.68/0.77 # Non-unit clause-clause subsumptions : 29
% 1.68/0.77 # Unit Clause-clause subsumption calls : 507
% 1.68/0.77 # Rewrite failures with RHS unbound : 0
% 1.68/0.77 # BW rewrite match attempts : 2
% 1.68/0.77 # BW rewrite match successes : 2
% 1.68/0.77 # Condensation attempts : 0
% 1.68/0.77 # Condensation successes : 0
% 1.68/0.77 # Termbank termtop insertions : 119240
% 1.68/0.77 # Search garbage collected termcells : 13630
% 1.68/0.77
% 1.68/0.77 # -------------------------------------------------
% 1.68/0.77 # User time : 0.199 s
% 1.68/0.77 # System time : 0.016 s
% 1.68/0.77 # Total time : 0.215 s
% 1.68/0.77 # Maximum resident set size: 4232 pages
% 1.68/0.77
% 1.68/0.77 # -------------------------------------------------
% 1.68/0.77 # User time : 0.204 s
% 1.68/0.77 # System time : 0.021 s
% 1.68/0.77 # Total time : 0.225 s
% 1.68/0.77 # Maximum resident set size: 2528 pages
% 1.68/0.77 % E---3.1 exiting
% 1.68/0.77 % E exiting
%------------------------------------------------------------------------------