TSTP Solution File: KRS266+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : KRS266+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:34 EDT 2024
% Result : Theorem 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 13 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 78 ( 35 ~; 25 |; 14 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 68 ( 10 sgn 27 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sca,axiom,
! [X1,X2] :
( ( ~ ? [X3] : model(X3,X1)
& ? [X4] : model(X4,X2) )
<=> status(X1,X2,sca) ),
file('/export/starexec/sandbox/tmp/tmp.DldoiM8Ukl/E---3.1_10197.p',sca) ).
fof(mighta,axiom,
! [X7,X8] :
( ? [X1,X2] :
( status(X1,X2,X7)
& status(X1,X2,X8) )
<=> mighta(X7,X8) ),
file('/export/starexec/sandbox/tmp/tmp.DldoiM8Ukl/E---3.1_10197.p',mighta) ).
fof(contradiction,axiom,
? [X10] :
! [X9] : ~ model(X9,X10),
file('/export/starexec/sandbox/tmp/tmp.DldoiM8Ukl/E---3.1_10197.p',contradiction) ).
fof(non_thm_spt,axiom,
? [X3,X1,X2] :
( model(X3,X1)
& ~ model(X3,X2)
& ? [X4] : model(X4,X2) ),
file('/export/starexec/sandbox/tmp/tmp.DldoiM8Ukl/E---3.1_10197.p',non_thm_spt) ).
fof(thm,axiom,
! [X1,X2] :
( ! [X3] :
( model(X3,X1)
=> model(X3,X2) )
<=> status(X1,X2,thm) ),
file('/export/starexec/sandbox/tmp/tmp.DldoiM8Ukl/E---3.1_10197.p',thm) ).
fof(mighta_sca_thm,conjecture,
mighta(sca,thm),
file('/export/starexec/sandbox/tmp/tmp.DldoiM8Ukl/E---3.1_10197.p',mighta_sca_thm) ).
fof(c_0_6,plain,
! [X25,X26,X28,X29,X30,X31] :
( ( model(esk4_2(X25,X26),X25)
| ~ model(X28,X26)
| status(X25,X26,sca) )
& ( ~ model(X31,X29)
| ~ status(X29,X30,sca) )
& ( model(esk5_2(X29,X30),X30)
| ~ status(X29,X30,sca) ) ),
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)],[sca])])])])])])]) ).
fof(c_0_7,plain,
! [X11,X12,X13,X14,X15,X16] :
( ( ~ status(X13,X14,X11)
| ~ status(X13,X14,X12)
| mighta(X11,X12) )
& ( status(esk1_2(X15,X16),esk2_2(X15,X16),X15)
| ~ mighta(X15,X16) )
& ( status(esk1_2(X15,X16),esk2_2(X15,X16),X16)
| ~ mighta(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)],[mighta])])])])])])]) ).
fof(c_0_8,plain,
? [X10] :
! [X9] : ~ model(X9,X10),
inference(fof_simplification,[status(thm)],[contradiction]) ).
fof(c_0_9,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_10,plain,
( ~ model(X1,X2)
| ~ status(X2,X3,sca) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( status(esk1_2(X1,X2),esk2_2(X1,X2),X1)
| ~ mighta(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,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_13,plain,
! [X39] : ~ model(X39,esk10_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_8])])]) ).
fof(c_0_14,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_9])])]) ).
cnf(c_0_15,plain,
( ~ mighta(sca,X1)
| ~ model(X2,esk1_2(sca,X1)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( model(esk3_2(X1,X2),X1)
| status(X1,X2,thm) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,negated_conjecture,
~ mighta(sca,thm),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[mighta_sca_thm])]) ).
cnf(c_0_18,plain,
~ model(X1,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( model(esk4_2(X1,X2),X1)
| status(X1,X2,sca)
| ~ model(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,plain,
model(esk23_0,esk22_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( mighta(X3,X4)
| ~ status(X1,X2,X3)
| ~ status(X1,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,plain,
( status(esk1_2(sca,X1),X2,thm)
| ~ mighta(sca,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_23,negated_conjecture,
~ mighta(sca,thm),
inference(fof_nnf,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
status(esk10_0,X1,thm),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_25,plain,
( status(X1,esk22_0,sca)
| model(esk4_2(X1,esk22_0),X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( mighta(X1,thm)
| ~ mighta(sca,X2)
| ~ status(esk1_2(sca,X2),X3,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
~ mighta(sca,thm),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
( mighta(X1,thm)
| ~ status(esk10_0,X2,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_29,plain,
status(esk10_0,esk22_0,sca),
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_30,plain,
~ mighta(sca,X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_11]),c_0_27]) ).
cnf(c_0_31,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : KRS266+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.22/0.35 % CPULimit : 300
% 0.22/0.35 % WCLimit : 300
% 0.22/0.35 % DateTime : Fri May 3 13:39:01 EDT 2024
% 0.22/0.35 % CPUTime :
% 0.22/0.49 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.DldoiM8Ukl/E---3.1_10197.p
% 0.22/0.51 # Version: 3.1.0
% 0.22/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # new_bool_3 with pid 10278 completed with status 0
% 0.22/0.51 # Result found by new_bool_3
% 0.22/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.51 # Search class: FGHNF-FFSM22-SFFFFFNN
% 0.22/0.51 # partial match(1): FGHNF-FFSF22-SFFFFFNN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.51 # SAT001_MinMin_p005000_rr_RG with pid 10281 completed with status 0
% 0.22/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.51 # Search class: FGHNF-FFSM22-SFFFFFNN
% 0.22/0.51 # partial match(1): FGHNF-FFSF22-SFFFFFNN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.51 # Preprocessing time : 0.002 s
% 0.22/0.51 # Presaturation interreduction done
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Theorem
% 0.22/0.51 # SZS output start CNFRefutation
% See solution above
% 0.22/0.51 # Parsed axioms : 33
% 0.22/0.51 # Removed by relevancy pruning/SinE : 23
% 0.22/0.51 # Initial clauses : 25
% 0.22/0.51 # Removed in clause preprocessing : 0
% 0.22/0.51 # Initial clauses in saturation : 25
% 0.22/0.51 # Processed clauses : 101
% 0.22/0.51 # ...of these trivial : 2
% 0.22/0.51 # ...subsumed : 13
% 0.22/0.51 # ...remaining for further processing : 86
% 0.22/0.51 # Other redundant clauses eliminated : 0
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 9
% 0.22/0.51 # Backward-rewritten : 0
% 0.22/0.51 # Generated clauses : 96
% 0.22/0.51 # ...of the previous two non-redundant : 71
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 0
% 0.22/0.51 # Paramodulations : 96
% 0.22/0.51 # Factorizations : 0
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 0
% 0.22/0.51 # Disequality decompositions : 0
% 0.22/0.51 # Total rewrite steps : 24
% 0.22/0.51 # ...of those cached : 22
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 52
% 0.22/0.51 # Positive orientable unit clauses : 14
% 0.22/0.51 # Positive unorientable unit clauses: 0
% 0.22/0.51 # Negative unit clauses : 10
% 0.22/0.51 # Non-unit-clauses : 28
% 0.22/0.51 # Current number of unprocessed clauses: 16
% 0.22/0.51 # ...number of literals in the above : 42
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 34
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 118
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 108
% 0.22/0.51 # Non-unit clause-clause subsumptions : 8
% 0.22/0.51 # Unit Clause-clause subsumption calls : 40
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 4
% 0.22/0.51 # BW rewrite match successes : 0
% 0.22/0.51 # Condensation attempts : 0
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 2745
% 0.22/0.51 # Search garbage collected termcells : 520
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.008 s
% 0.22/0.51 # System time : 0.004 s
% 0.22/0.51 # Total time : 0.012 s
% 0.22/0.51 # Maximum resident set size: 1896 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.009 s
% 0.22/0.51 # System time : 0.006 s
% 0.22/0.51 # Total time : 0.016 s
% 0.22/0.51 # Maximum resident set size: 1752 pages
% 0.22/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------