TSTP Solution File: GEO278+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GEO278+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:34:45 EDT 2023
% Result : Theorem 0.94s 0.59s
% Output : CNFRefutation 0.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 8 unt; 0 def)
% Number of atoms : 75 ( 20 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 96 ( 40 ~; 36 |; 17 &)
% ( 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 : 5 ( 5 usr; 4 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,
! [X105,X106,X107,X108,X109] :
( ( vf(X107,X105) = vf(X107,X106)
& ron(X106,X109)
& ron(X105,X108)
& rcenter(X107,X109)
& rcenter(X107,X108)
& ? [X110] :
( X106 = X110
& rpoint(X110) )
& ? [X111] :
( X105 = X111
& rpoint(X111) ) )
=> X108 = X109 ),
file('/export/starexec/sandbox/tmp/tmp.jkcOBQAINs/E---3.1_15869.p','qu(cond(axiom(182), 0), imp(cond(axiom(182), 0)))') ).
fof('qu(theu(the(231), 1), imp(the(231)))',conjecture,
! [X1] :
( ( ron(vd1096,X1)
& rcenter(vd1089,X1)
& rcircle(X1) )
=> X1 = vd1102 ),
file('/export/starexec/sandbox/tmp/tmp.jkcOBQAINs/E---3.1_15869.p','qu(theu(the(231), 1), imp(the(231)))') ).
fof('and(pred(comma_conjunct2(the(231)), 0), and(pred(comma_conjunct1(the(231)), 0), pred(the(231), 0)))',axiom,
( ron(vd1096,vd1102)
& rcenter(vd1089,vd1102)
& rcircle(vd1102) ),
file('/export/starexec/sandbox/tmp/tmp.jkcOBQAINs/E---3.1_15869.p','and(pred(comma_conjunct2(the(231)), 0), and(pred(comma_conjunct1(the(231)), 0), pred(the(231), 0)))') ).
fof('pred(229, 0)',axiom,
rpoint(vd1096),
file('/export/starexec/sandbox/tmp/tmp.jkcOBQAINs/E---3.1_15869.p','pred(229, 0)') ).
fof(c_0_4,plain,
! [X755,X756,X757,X758,X759,X760,X761] :
( vf(X757,X755) != vf(X757,X756)
| ~ ron(X756,X759)
| ~ ron(X755,X758)
| ~ rcenter(X757,X759)
| ~ rcenter(X757,X758)
| X756 != X760
| ~ rpoint(X760)
| X755 != X761
| ~ rpoint(X761)
| X758 = X759 ),
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(vd1096,X1)
& rcenter(vd1089,X1)
& rcircle(X1) )
=> X1 = vd1102 ),
inference(assume_negation,[status(cth)],['qu(theu(the(231), 1), imp(the(231)))']) ).
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(vd1096,esk1_0)
& rcenter(vd1089,esk1_0)
& rcircle(esk1_0)
& esk1_0 != vd1102 ),
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(vd1089,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( X1 = esk1_0
| ~ rpoint(X2)
| ~ rcenter(vd1089,X1)
| ~ ron(X2,esk1_0)
| ~ ron(X2,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
rcenter(vd1089,vd1102),
inference(split_conjunct,[status(thm)],['and(pred(comma_conjunct2(the(231)), 0), and(pred(comma_conjunct1(the(231)), 0), pred(the(231), 0)))']) ).
cnf(c_0_13,negated_conjecture,
esk1_0 != vd1102,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
( ~ rpoint(X1)
| ~ ron(X1,esk1_0)
| ~ ron(X1,vd1102) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_15,negated_conjecture,
ron(vd1096,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
rpoint(vd1096),
inference(split_conjunct,[status(thm)],['pred(229, 0)']) ).
cnf(c_0_17,plain,
ron(vd1096,vd1102),
inference(split_conjunct,[status(thm)],['and(pred(comma_conjunct2(the(231)), 0), and(pred(comma_conjunct1(the(231)), 0), pred(the(231), 0)))']) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GEO278+1 : TPTP v8.1.2. Released v4.1.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n014.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 06:59:34 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.45 Running first-order model finding
% 0.17/0.45 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.jkcOBQAINs/E---3.1_15869.p
% 0.94/0.59 # Version: 3.1pre001
% 0.94/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.94/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.94/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.94/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.94/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.94/0.59 # Starting sh5l with 300s (1) cores
% 0.94/0.59 # new_bool_3 with pid 15947 completed with status 0
% 0.94/0.59 # Result found by new_bool_3
% 0.94/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.94/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.94/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.94/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.94/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.94/0.59 # Search class: FGHSF-FSLM33-SFFFFFNN
% 0.94/0.59 # Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.94/0.59 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 55s (1) cores
% 0.94/0.59 # G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with pid 15950 completed with status 0
% 0.94/0.59 # Result found by G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U
% 0.94/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.94/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.94/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.94/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.94/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.94/0.59 # Search class: FGHSF-FSLM33-SFFFFFNN
% 0.94/0.59 # Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.94/0.59 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 55s (1) cores
% 0.94/0.59 # Preprocessing time : 0.007 s
% 0.94/0.59 # Presaturation interreduction done
% 0.94/0.59
% 0.94/0.59 # Proof found!
% 0.94/0.59 # SZS status Theorem
% 0.94/0.59 # SZS output start CNFRefutation
% See solution above
% 0.94/0.59 # Parsed axioms : 130
% 0.94/0.59 # Removed by relevancy pruning/SinE : 40
% 0.94/0.59 # Initial clauses : 198
% 0.94/0.59 # Removed in clause preprocessing : 0
% 0.94/0.59 # Initial clauses in saturation : 198
% 0.94/0.59 # Processed clauses : 667
% 0.94/0.59 # ...of these trivial : 0
% 0.94/0.59 # ...subsumed : 33
% 0.94/0.59 # ...remaining for further processing : 634
% 0.94/0.59 # Other redundant clauses eliminated : 539
% 0.94/0.59 # Clauses deleted for lack of memory : 0
% 0.94/0.59 # Backward-subsumed : 1
% 0.94/0.59 # Backward-rewritten : 0
% 0.94/0.59 # Generated clauses : 1031
% 0.94/0.59 # ...of the previous two non-redundant : 1005
% 0.94/0.59 # ...aggressively subsumed : 0
% 0.94/0.59 # Contextual simplify-reflections : 10
% 0.94/0.59 # Paramodulations : 846
% 0.94/0.59 # Factorizations : 6
% 0.94/0.59 # NegExts : 0
% 0.94/0.59 # Equation resolutions : 544
% 0.94/0.59 # Total rewrite steps : 399
% 0.94/0.59 # Propositional unsat checks : 0
% 0.94/0.59 # Propositional check models : 0
% 0.94/0.59 # Propositional check unsatisfiable : 0
% 0.94/0.59 # Propositional clauses : 0
% 0.94/0.59 # Propositional clauses after purity: 0
% 0.94/0.59 # Propositional unsat core size : 0
% 0.94/0.59 # Propositional preprocessing time : 0.000
% 0.94/0.59 # Propositional encoding time : 0.000
% 0.94/0.59 # Propositional solver time : 0.000
% 0.94/0.59 # Success case prop preproc time : 0.000
% 0.94/0.59 # Success case prop encoding time : 0.000
% 0.94/0.59 # Success case prop solver time : 0.000
% 0.94/0.59 # Current number of processed clauses : 263
% 0.94/0.59 # Positive orientable unit clauses : 19
% 0.94/0.59 # Positive unorientable unit clauses: 0
% 0.94/0.59 # Negative unit clauses : 16
% 0.94/0.59 # Non-unit-clauses : 228
% 0.94/0.59 # Current number of unprocessed clauses: 711
% 0.94/0.59 # ...number of literals in the above : 6775
% 0.94/0.59 # Current number of archived formulas : 0
% 0.94/0.59 # Current number of archived clauses : 197
% 0.94/0.59 # Clause-clause subsumption calls (NU) : 61184
% 0.94/0.59 # Rec. Clause-clause subsumption calls : 4065
% 0.94/0.59 # Non-unit clause-clause subsumptions : 38
% 0.94/0.59 # Unit Clause-clause subsumption calls : 1225
% 0.94/0.59 # Rewrite failures with RHS unbound : 0
% 0.94/0.59 # BW rewrite match attempts : 0
% 0.94/0.59 # BW rewrite match successes : 0
% 0.94/0.59 # Condensation attempts : 0
% 0.94/0.59 # Condensation successes : 0
% 0.94/0.59 # Termbank termtop insertions : 53316
% 0.94/0.59
% 0.94/0.59 # -------------------------------------------------
% 0.94/0.59 # User time : 0.109 s
% 0.94/0.59 # System time : 0.005 s
% 0.94/0.59 # Total time : 0.114 s
% 0.94/0.59 # Maximum resident set size: 3632 pages
% 0.94/0.59
% 0.94/0.59 # -------------------------------------------------
% 0.94/0.59 # User time : 0.116 s
% 0.94/0.59 # System time : 0.009 s
% 0.94/0.59 # Total time : 0.124 s
% 0.94/0.59 # Maximum resident set size: 2520 pages
% 0.94/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------