TSTP Solution File: KRS251+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KRS251+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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 08:12:35 EDT 2024
% Result : Theorem 4.31s 1.03s
% Output : CNFRefutation 4.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 10 unt; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 91 ( 33 ~; 40 |; 9 &)
% ( 6 <=>; 1 =>; 0 <=; 2 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 70 ( 0 sgn 37 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(completeness,axiom,
! [X9,X10] :
( model(X9,X10)
<~> model(X9,not(X10)) ),
file('/export/starexec/sandbox/tmp/tmp.I0gCHFTTFX/E---3.1_20453.p',completeness) ).
fof(csa,axiom,
! [X1,X2] :
( ? [X3] :
( model(X3,X1)
& model(X3,not(X2)) )
<=> status(X1,X2,csa) ),
file('/export/starexec/sandbox/tmp/tmp.I0gCHFTTFX/E---3.1_20453.p',csa) ).
fof(thm,axiom,
! [X1,X2] :
( ! [X3] :
( model(X3,X1)
=> model(X3,X2) )
<=> status(X1,X2,thm) ),
file('/export/starexec/sandbox/tmp/tmp.I0gCHFTTFX/E---3.1_20453.p',thm) ).
fof(xora,axiom,
! [X7,X8] :
( ! [X1,X2] :
( status(X1,X2,X7)
<~> status(X1,X2,X8) )
<=> xora(X7,X8) ),
file('/export/starexec/sandbox/tmp/tmp.I0gCHFTTFX/E---3.1_20453.p',xora) ).
fof(xora_csa_thm,conjecture,
xora(csa,thm),
file('/export/starexec/sandbox/tmp/tmp.I0gCHFTTFX/E---3.1_20453.p',xora_csa_thm) ).
fof(c_0_5,plain,
! [X9,X10] :
~ ( model(X9,X10)
<=> model(X9,not(X10)) ),
inference(fof_simplification,[status(thm)],[completeness]) ).
fof(c_0_6,plain,
! [X27,X28,X29,X30,X31] :
( ( ~ model(X29,X27)
| ~ model(X29,not(X28))
| status(X27,X28,csa) )
& ( model(esk4_2(X30,X31),X30)
| ~ status(X30,X31,csa) )
& ( model(esk4_2(X30,X31),not(X31))
| ~ status(X30,X31,csa) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[csa])])])])])])]) ).
fof(c_0_7,plain,
! [X54,X55] :
( ( ~ model(X54,X55)
| ~ model(X54,not(X55)) )
& ( model(X54,X55)
| model(X54,not(X55)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_8,plain,
( status(X2,X3,csa)
| ~ model(X1,X2)
| ~ model(X1,not(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( model(X1,X2)
| model(X1,not(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X21,X22,X24,X25,X26] :
( ( model(esk3_2(X21,X22),X21)
| status(X21,X22,thm) )
& ( ~ model(esk3_2(X21,X22),X22)
| status(X21,X22,thm) )
& ( ~ status(X24,X25,thm)
| ~ model(X26,X24)
| model(X26,X25) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[thm])])])])])])]) ).
fof(c_0_11,plain,
! [X7,X8] :
( ! [X1,X2] :
~ ( status(X1,X2,X7)
<=> status(X1,X2,X8) )
<=> xora(X7,X8) ),
inference(fof_simplification,[status(thm)],[xora]) ).
cnf(c_0_12,plain,
( status(X1,X2,csa)
| model(X3,X2)
| ~ model(X3,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( model(esk3_2(X1,X2),X1)
| status(X1,X2,thm) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X11,X12,X15,X16,X17,X18,X19,X20] :
( ( ~ status(esk1_2(X11,X12),esk2_2(X11,X12),X11)
| status(esk1_2(X11,X12),esk2_2(X11,X12),X12)
| xora(X11,X12) )
& ( ~ status(esk1_2(X11,X12),esk2_2(X11,X12),X12)
| status(esk1_2(X11,X12),esk2_2(X11,X12),X11)
| xora(X11,X12) )
& ( ~ status(X17,X18,X15)
| ~ status(X17,X18,X16)
| ~ xora(X15,X16) )
& ( status(X19,X20,X15)
| status(X19,X20,X16)
| ~ xora(X15,X16) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])])])]) ).
cnf(c_0_15,plain,
( status(X1,X2,thm)
| ~ model(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( status(X1,X2,thm)
| status(X1,X3,csa)
| model(esk3_2(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_17,negated_conjecture,
~ xora(csa,thm),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[xora_csa_thm])]) ).
cnf(c_0_18,plain,
( status(esk1_2(X1,X2),esk2_2(X1,X2),X2)
| xora(X1,X2)
| ~ status(esk1_2(X1,X2),esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( status(X1,X2,csa)
| status(X1,X2,thm) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_20,negated_conjecture,
~ xora(csa,thm),
inference(fof_nnf,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
( xora(csa,X1)
| status(esk1_2(csa,X1),esk2_2(csa,X1),thm)
| status(esk1_2(csa,X1),esk2_2(csa,X1),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
~ xora(csa,thm),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,plain,
( status(esk1_2(X1,X2),esk2_2(X1,X2),X1)
| xora(X1,X2)
| ~ status(esk1_2(X1,X2),esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
status(esk1_2(csa,thm),esk2_2(csa,thm),thm),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_21]),c_0_22]) ).
cnf(c_0_25,plain,
( model(X3,X2)
| ~ status(X1,X2,thm)
| ~ model(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,plain,
( model(esk4_2(X1,X2),X1)
| ~ status(X1,X2,csa) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_27,plain,
status(esk1_2(csa,thm),esk2_2(csa,thm),csa),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_22]) ).
cnf(c_0_28,plain,
( model(esk4_2(X1,X2),not(X2))
| ~ status(X1,X2,csa) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_29,plain,
( model(X1,esk2_2(csa,thm))
| ~ model(X1,esk1_2(csa,thm)) ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_30,plain,
model(esk4_2(esk1_2(csa,thm),esk2_2(csa,thm)),esk1_2(csa,thm)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( ~ model(X1,X2)
| ~ model(X1,not(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_32,plain,
model(esk4_2(esk1_2(csa,thm),esk2_2(csa,thm)),not(esk2_2(csa,thm))),
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_33,plain,
model(esk4_2(esk1_2(csa,thm),esk2_2(csa,thm)),esk2_2(csa,thm)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : KRS251+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n022.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 13:42:42 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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.I0gCHFTTFX/E---3.1_20453.p
% 4.31/1.03 # Version: 3.1.0
% 4.31/1.03 # Preprocessing class: FSMSSMSMSSSNFFN.
% 4.31/1.03 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.31/1.03 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 4.31/1.03 # Starting new_bool_3 with 300s (1) cores
% 4.31/1.03 # Starting new_bool_1 with 300s (1) cores
% 4.31/1.03 # Starting sh5l with 300s (1) cores
% 4.31/1.03 # new_bool_1 with pid 20607 completed with status 0
% 4.31/1.03 # Result found by new_bool_1
% 4.31/1.03 # Preprocessing class: FSMSSMSMSSSNFFN.
% 4.31/1.03 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.31/1.03 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 4.31/1.03 # Starting new_bool_3 with 300s (1) cores
% 4.31/1.03 # Starting new_bool_1 with 300s (1) cores
% 4.31/1.03 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.31/1.03 # Search class: FGHNF-FFMM21-SFFFFFNN
% 4.31/1.03 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.31/1.03 # Starting G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S with 131s (1) cores
% 4.31/1.03 # G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S with pid 20610 completed with status 0
% 4.31/1.03 # Result found by G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S
% 4.31/1.03 # Preprocessing class: FSMSSMSMSSSNFFN.
% 4.31/1.03 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.31/1.03 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 4.31/1.03 # Starting new_bool_3 with 300s (1) cores
% 4.31/1.03 # Starting new_bool_1 with 300s (1) cores
% 4.31/1.03 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.31/1.03 # Search class: FGHNF-FFMM21-SFFFFFNN
% 4.31/1.03 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.31/1.03 # Starting G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S with 131s (1) cores
% 4.31/1.03 # Preprocessing time : 0.002 s
% 4.31/1.03 # Presaturation interreduction done
% 4.31/1.03
% 4.31/1.03 # Proof found!
% 4.31/1.03 # SZS status Theorem
% 4.31/1.03 # SZS output start CNFRefutation
% See solution above
% 4.31/1.03 # Parsed axioms : 33
% 4.31/1.03 # Removed by relevancy pruning/SinE : 21
% 4.31/1.03 # Initial clauses : 30
% 4.31/1.03 # Removed in clause preprocessing : 0
% 4.31/1.03 # Initial clauses in saturation : 30
% 4.31/1.03 # Processed clauses : 5034
% 4.31/1.03 # ...of these trivial : 527
% 4.31/1.03 # ...subsumed : 2565
% 4.31/1.03 # ...remaining for further processing : 1942
% 4.31/1.03 # Other redundant clauses eliminated : 0
% 4.31/1.03 # Clauses deleted for lack of memory : 0
% 4.31/1.03 # Backward-subsumed : 22
% 4.31/1.03 # Backward-rewritten : 4
% 4.31/1.03 # Generated clauses : 52380
% 4.31/1.03 # ...of the previous two non-redundant : 46478
% 4.31/1.03 # ...aggressively subsumed : 0
% 4.31/1.03 # Contextual simplify-reflections : 0
% 4.31/1.03 # Paramodulations : 52292
% 4.31/1.03 # Factorizations : 88
% 4.31/1.03 # NegExts : 0
% 4.31/1.03 # Equation resolutions : 0
% 4.31/1.03 # Disequality decompositions : 0
% 4.31/1.03 # Total rewrite steps : 6557
% 4.31/1.03 # ...of those cached : 5963
% 4.31/1.03 # Propositional unsat checks : 0
% 4.31/1.03 # Propositional check models : 0
% 4.31/1.03 # Propositional check unsatisfiable : 0
% 4.31/1.03 # Propositional clauses : 0
% 4.31/1.03 # Propositional clauses after purity: 0
% 4.31/1.03 # Propositional unsat core size : 0
% 4.31/1.03 # Propositional preprocessing time : 0.000
% 4.31/1.03 # Propositional encoding time : 0.000
% 4.31/1.03 # Propositional solver time : 0.000
% 4.31/1.03 # Success case prop preproc time : 0.000
% 4.31/1.03 # Success case prop encoding time : 0.000
% 4.31/1.03 # Success case prop solver time : 0.000
% 4.31/1.03 # Current number of processed clauses : 1888
% 4.31/1.03 # Positive orientable unit clauses : 346
% 4.31/1.03 # Positive unorientable unit clauses: 0
% 4.31/1.03 # Negative unit clauses : 66
% 4.31/1.03 # Non-unit-clauses : 1476
% 4.31/1.03 # Current number of unprocessed clauses: 41187
% 4.31/1.03 # ...number of literals in the above : 121592
% 4.31/1.03 # Current number of archived formulas : 0
% 4.31/1.03 # Current number of archived clauses : 54
% 4.31/1.03 # Clause-clause subsumption calls (NU) : 215327
% 4.31/1.03 # Rec. Clause-clause subsumption calls : 130191
% 4.31/1.03 # Non-unit clause-clause subsumptions : 2582
% 4.31/1.03 # Unit Clause-clause subsumption calls : 7853
% 4.31/1.03 # Rewrite failures with RHS unbound : 0
% 4.31/1.03 # BW rewrite match attempts : 2147
% 4.31/1.03 # BW rewrite match successes : 4
% 4.31/1.03 # Condensation attempts : 0
% 4.31/1.03 # Condensation successes : 0
% 4.31/1.03 # Termbank termtop insertions : 663389
% 4.31/1.03 # Search garbage collected termcells : 587
% 4.31/1.03
% 4.31/1.03 # -------------------------------------------------
% 4.31/1.03 # User time : 0.496 s
% 4.31/1.03 # System time : 0.020 s
% 4.31/1.03 # Total time : 0.516 s
% 4.31/1.03 # Maximum resident set size: 1872 pages
% 4.31/1.03
% 4.31/1.03 # -------------------------------------------------
% 4.31/1.03 # User time : 0.499 s
% 4.31/1.03 # System time : 0.021 s
% 4.31/1.03 # Total time : 0.520 s
% 4.31/1.03 # Maximum resident set size: 1752 pages
% 4.31/1.03 % E---3.1 exiting
% 4.31/1.03 % E exiting
%------------------------------------------------------------------------------