TSTP Solution File: KRS217+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : KRS217+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:13:29 EDT 2024
% Result : Theorem 0.86s 0.61s
% Output : CNFRefutation 0.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 57 ( 22 unt; 0 def)
% Number of atoms : 141 ( 0 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 141 ( 57 ~; 53 |; 23 &)
% ( 6 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 9 con; 0-2 aty)
% Number of variables : 112 ( 10 sgn 44 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(completeness,axiom,
! [X9,X10] :
( model(X9,X10)
<~> model(X9,not(X10)) ),
file('/export/starexec/sandbox2/tmp/tmp.NdSTdgIFox/E---3.1_28759.p',completeness) ).
fof(contradiction,axiom,
? [X10] :
! [X9] : ~ model(X9,X10),
file('/export/starexec/sandbox2/tmp/tmp.NdSTdgIFox/E---3.1_28759.p',contradiction) ).
fof(thm,axiom,
! [X1,X2] :
( ! [X3] :
( model(X3,X1)
=> model(X3,X2) )
<=> status(X1,X2,thm) ),
file('/export/starexec/sandbox2/tmp/tmp.NdSTdgIFox/E---3.1_28759.p',thm) ).
fof(tautology,axiom,
? [X10] :
! [X9] : model(X9,X10),
file('/export/starexec/sandbox2/tmp/tmp.NdSTdgIFox/E---3.1_28759.p',tautology) ).
fof(csa,axiom,
! [X1,X2] :
( ? [X3] :
( model(X3,X1)
& model(X3,not(X2)) )
<=> status(X1,X2,csa) ),
file('/export/starexec/sandbox2/tmp/tmp.NdSTdgIFox/E---3.1_28759.p',csa) ).
fof(non_thm_spt,axiom,
? [X3,X1,X2] :
( model(X3,X1)
& ~ model(X3,X2)
& ? [X4] : model(X4,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.NdSTdgIFox/E---3.1_28759.p',non_thm_spt) ).
fof(noc,axiom,
! [X1,X2] :
( ( ? [X3] :
( model(X3,X1)
& model(X3,X2) )
& ? [X4] :
( model(X4,X1)
& model(X4,not(X2)) ) )
<=> status(X1,X2,noc) ),
file('/export/starexec/sandbox2/tmp/tmp.NdSTdgIFox/E---3.1_28759.p',noc) ).
fof(nota,axiom,
! [X7,X8] :
( ? [X1,X2] :
( status(X1,X2,X7)
& ~ status(X1,X2,X8) )
<=> nota(X7,X8) ),
file('/export/starexec/sandbox2/tmp/tmp.NdSTdgIFox/E---3.1_28759.p',nota) ).
fof(nota_noc_thm,conjecture,
nota(noc,thm),
file('/export/starexec/sandbox2/tmp/tmp.NdSTdgIFox/E---3.1_28759.p',nota_noc_thm) ).
fof(c_0_9,plain,
! [X9,X10] :
~ ( model(X9,X10)
<=> model(X9,not(X10)) ),
inference(fof_simplification,[status(thm)],[completeness]) ).
fof(c_0_10,plain,
? [X10] :
! [X9] : ~ model(X9,X10),
inference(fof_simplification,[status(thm)],[contradiction]) ).
fof(c_0_11,plain,
! [X19,X20,X22,X23,X24] :
( ( model(esk3_2(X19,X20),X19)
| status(X19,X20,thm) )
& ( ~ model(esk3_2(X19,X20),X20)
| status(X19,X20,thm) )
& ( ~ status(X22,X23,thm)
| ~ model(X24,X22)
| model(X24,X23) ) ),
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_12,plain,
! [X68,X69] :
( ( ~ model(X68,X69)
| ~ model(X68,not(X69)) )
& ( model(X68,X69)
| model(X68,not(X69)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_13,plain,
! [X39] : ~ model(X39,esk10_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_10])])]) ).
cnf(c_0_14,plain,
( status(X1,X2,thm)
| ~ model(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( model(X1,X2)
| model(X1,not(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
~ model(X1,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( status(X1,not(X2),thm)
| model(esk3_2(X1,not(X2)),X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( model(X3,X2)
| ~ status(X1,X2,thm)
| ~ model(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
status(X1,not(esk10_0),thm),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_20,plain,
! [X34] : model(X34,esk6_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[tautology])]) ).
fof(c_0_21,plain,
! [X54,X55,X56,X57,X58] :
( ( ~ model(X56,X54)
| ~ model(X56,not(X55))
| status(X54,X55,csa) )
& ( model(esk24_2(X57,X58),X57)
| ~ status(X57,X58,csa) )
& ( model(esk24_2(X57,X58),not(X58))
| ~ status(X57,X58,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_22,plain,
? [X3,X1,X2] :
( model(X3,X1)
& ~ model(X3,X2)
& ? [X4] : model(X4,X2) ),
inference(fof_simplification,[status(thm)],[non_thm_spt]) ).
cnf(c_0_23,plain,
( model(X1,not(esk10_0))
| ~ model(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
model(X1,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
( status(X2,X3,csa)
| ~ model(X1,X2)
| ~ model(X1,not(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_26,plain,
( model(esk20_0,esk21_0)
& ~ model(esk20_0,esk22_0)
& model(esk23_0,esk22_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_22])])]) ).
fof(c_0_27,plain,
! [X25,X26,X27,X28,X29,X30] :
( ( ~ model(X27,X25)
| ~ model(X27,X26)
| ~ model(X28,X25)
| ~ model(X28,not(X26))
| status(X25,X26,noc) )
& ( model(esk4_2(X29,X30),X29)
| ~ status(X29,X30,noc) )
& ( model(esk4_2(X29,X30),X30)
| ~ status(X29,X30,noc) )
& ( model(esk5_2(X29,X30),X29)
| ~ status(X29,X30,noc) )
& ( model(esk5_2(X29,X30),not(X30))
| ~ status(X29,X30,noc) ) ),
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)],[noc])])])])])])]) ).
cnf(c_0_28,plain,
model(X1,not(esk10_0)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( status(X1,X2,csa)
| model(X3,X2)
| ~ model(X3,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_15]) ).
cnf(c_0_30,plain,
model(esk20_0,esk21_0),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
( status(X2,X3,noc)
| ~ model(X1,X2)
| ~ model(X1,X3)
| ~ model(X4,X2)
| ~ model(X4,not(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
( status(X1,esk10_0,csa)
| ~ model(X2,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_28]) ).
cnf(c_0_33,plain,
model(esk23_0,esk22_0),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,plain,
( model(esk24_2(X1,X2),not(X2))
| ~ status(X1,X2,csa) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_35,plain,
( status(esk21_0,X1,csa)
| model(esk20_0,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
( status(X1,X2,noc)
| model(X3,X2)
| ~ model(X3,X1)
| ~ model(X4,X2)
| ~ model(X4,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_15]) ).
cnf(c_0_37,plain,
( model(esk24_2(X1,X2),X1)
| ~ status(X1,X2,csa) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_38,plain,
status(esk22_0,esk10_0,csa),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
fof(c_0_39,plain,
! [X7,X8] :
( ? [X1,X2] :
( status(X1,X2,X7)
& ~ status(X1,X2,X8) )
<=> nota(X7,X8) ),
inference(fof_simplification,[status(thm)],[nota]) ).
cnf(c_0_40,plain,
( ~ model(X1,X2)
| ~ model(X1,not(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_41,plain,
( model(esk24_2(esk21_0,X1),not(X1))
| model(esk20_0,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,plain,
( status(esk6_0,X1,noc)
| model(X2,X1)
| ~ model(X3,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_24]),c_0_24])]) ).
cnf(c_0_43,plain,
model(esk24_2(esk22_0,esk10_0),esk22_0),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
fof(c_0_44,negated_conjecture,
~ nota(noc,thm),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[nota_noc_thm])]) ).
fof(c_0_45,plain,
! [X11,X12,X13,X14,X15,X16] :
( ( ~ status(X13,X14,X11)
| status(X13,X14,X12)
| nota(X11,X12) )
& ( status(esk1_2(X15,X16),esk2_2(X15,X16),X15)
| ~ nota(X15,X16) )
& ( ~ status(esk1_2(X15,X16),esk2_2(X15,X16),X16)
| ~ nota(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_39])])])])])])]) ).
cnf(c_0_46,plain,
( model(esk20_0,X1)
| ~ model(esk24_2(esk21_0,X1),X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,plain,
( status(esk6_0,esk22_0,noc)
| model(X1,esk22_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,plain,
~ model(esk20_0,esk22_0),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_49,negated_conjecture,
~ nota(noc,thm),
inference(fof_nnf,[status(thm)],[c_0_44]) ).
cnf(c_0_50,plain,
( status(X1,X2,X4)
| nota(X3,X4)
| ~ status(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_51,plain,
status(esk6_0,esk22_0,noc),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_52,negated_conjecture,
~ nota(noc,thm),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_53,plain,
( nota(noc,X1)
| status(esk6_0,esk22_0,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
status(esk6_0,esk22_0,thm),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_55,negated_conjecture,
model(X1,esk22_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_54]),c_0_24])]) ).
cnf(c_0_56,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS217+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n006.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 13:37:49 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.NdSTdgIFox/E---3.1_28759.p
% 0.86/0.61 # Version: 3.1.0
% 0.86/0.61 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.86/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.86/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.86/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.86/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.86/0.61 # Starting sh5l with 300s (1) cores
% 0.86/0.61 # sh5l with pid 28839 completed with status 0
% 0.86/0.61 # Result found by sh5l
% 0.86/0.61 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.86/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.86/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.86/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.86/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.86/0.61 # Starting sh5l with 300s (1) cores
% 0.86/0.61 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.86/0.61 # Search class: FGHNF-FFMM21-SFFFFFNN
% 0.86/0.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.86/0.61 # Starting G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S with 131s (1) cores
% 0.86/0.61 # G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S with pid 28842 completed with status 0
% 0.86/0.61 # Result found by G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S
% 0.86/0.61 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.86/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.86/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.86/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.86/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.86/0.61 # Starting sh5l with 300s (1) cores
% 0.86/0.61 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.86/0.61 # Search class: FGHNF-FFMM21-SFFFFFNN
% 0.86/0.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.86/0.61 # Starting G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S with 131s (1) cores
% 0.86/0.61 # Preprocessing time : 0.002 s
% 0.86/0.61 # Presaturation interreduction done
% 0.86/0.61
% 0.86/0.61 # Proof found!
% 0.86/0.61 # SZS status Theorem
% 0.86/0.61 # SZS output start CNFRefutation
% See solution above
% 0.86/0.61 # Parsed axioms : 33
% 0.86/0.61 # Removed by relevancy pruning/SinE : 19
% 0.86/0.61 # Initial clauses : 37
% 0.86/0.61 # Removed in clause preprocessing : 0
% 0.86/0.61 # Initial clauses in saturation : 37
% 0.86/0.61 # Processed clauses : 964
% 0.86/0.61 # ...of these trivial : 105
% 0.86/0.61 # ...subsumed : 266
% 0.86/0.61 # ...remaining for further processing : 593
% 0.86/0.61 # Other redundant clauses eliminated : 0
% 0.86/0.61 # Clauses deleted for lack of memory : 0
% 0.86/0.61 # Backward-subsumed : 25
% 0.86/0.61 # Backward-rewritten : 57
% 0.86/0.61 # Generated clauses : 8432
% 0.86/0.61 # ...of the previous two non-redundant : 7011
% 0.86/0.61 # ...aggressively subsumed : 0
% 0.86/0.61 # Contextual simplify-reflections : 0
% 0.86/0.61 # Paramodulations : 8408
% 0.86/0.61 # Factorizations : 24
% 0.86/0.61 # NegExts : 0
% 0.86/0.61 # Equation resolutions : 0
% 0.86/0.61 # Disequality decompositions : 0
% 0.86/0.61 # Total rewrite steps : 1552
% 0.86/0.61 # ...of those cached : 1259
% 0.86/0.61 # Propositional unsat checks : 0
% 0.86/0.61 # Propositional check models : 0
% 0.86/0.61 # Propositional check unsatisfiable : 0
% 0.86/0.61 # Propositional clauses : 0
% 0.86/0.61 # Propositional clauses after purity: 0
% 0.86/0.61 # Propositional unsat core size : 0
% 0.86/0.61 # Propositional preprocessing time : 0.000
% 0.86/0.61 # Propositional encoding time : 0.000
% 0.86/0.61 # Propositional solver time : 0.000
% 0.86/0.61 # Success case prop preproc time : 0.000
% 0.86/0.61 # Success case prop encoding time : 0.000
% 0.86/0.61 # Success case prop solver time : 0.000
% 0.86/0.61 # Current number of processed clauses : 476
% 0.86/0.61 # Positive orientable unit clauses : 154
% 0.86/0.61 # Positive unorientable unit clauses: 0
% 0.86/0.61 # Negative unit clauses : 18
% 0.86/0.61 # Non-unit-clauses : 304
% 0.86/0.61 # Current number of unprocessed clauses: 6020
% 0.86/0.61 # ...number of literals in the above : 17185
% 0.86/0.61 # Current number of archived formulas : 0
% 0.86/0.61 # Current number of archived clauses : 117
% 0.86/0.61 # Clause-clause subsumption calls (NU) : 29248
% 0.86/0.61 # Rec. Clause-clause subsumption calls : 16176
% 0.86/0.61 # Non-unit clause-clause subsumptions : 258
% 0.86/0.61 # Unit Clause-clause subsumption calls : 2471
% 0.86/0.61 # Rewrite failures with RHS unbound : 0
% 0.86/0.61 # BW rewrite match attempts : 231
% 0.86/0.61 # BW rewrite match successes : 12
% 0.86/0.61 # Condensation attempts : 0
% 0.86/0.61 # Condensation successes : 0
% 0.86/0.61 # Termbank termtop insertions : 107903
% 0.86/0.61 # Search garbage collected termcells : 686
% 0.86/0.61
% 0.86/0.61 # -------------------------------------------------
% 0.86/0.61 # User time : 0.127 s
% 0.86/0.61 # System time : 0.005 s
% 0.86/0.61 # Total time : 0.132 s
% 0.86/0.61 # Maximum resident set size: 1868 pages
% 0.86/0.61
% 0.86/0.61 # -------------------------------------------------
% 0.86/0.61 # User time : 0.128 s
% 0.86/0.61 # System time : 0.008 s
% 0.86/0.61 # Total time : 0.136 s
% 0.86/0.61 # Maximum resident set size: 1752 pages
% 0.86/0.61 % E---3.1 exiting
%------------------------------------------------------------------------------