TSTP Solution File: KRS260+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : KRS260+1 : TPTP v8.2.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : Mon May 20 23:18:02 EDT 2024
% Result : Theorem 0.21s 0.48s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 12 unt; 0 def)
% Number of atoms : 89 ( 0 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 96 ( 35 ~; 32 |; 22 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-2 aty)
% Number of variables : 65 ( 8 sgn 31 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(wec,axiom,
! [X1,X2] :
( ( ? [X3] : model(X3,X1)
& ! [X4] :
( model(X4,X1)
=> model(X4,X2) )
& ? [X5] :
( model(X5,X2)
& ~ model(X5,X1) ) )
<=> status(X1,X2,wec) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+0.ax',wec) ).
fof(thm,axiom,
! [X1,X2] :
( ! [X3] :
( model(X3,X1)
=> model(X3,X2) )
<=> status(X1,X2,thm) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+0.ax',thm) ).
fof(tautology,axiom,
? [X10] :
! [X9] : model(X9,X10),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',tautology) ).
fof(non_thm_spt,axiom,
? [X3,X1,X2] :
( model(X3,X1)
& ~ model(X3,X2)
& ? [X4] : model(X4,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',non_thm_spt) ).
fof(mighta,axiom,
! [X7,X8] :
( ? [X1,X2] :
( status(X1,X2,X7)
& status(X1,X2,X8) )
<=> mighta(X7,X8) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',mighta) ).
fof(mighta_wec_thm,conjecture,
mighta(wec,thm),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mighta_wec_thm) ).
fof(c_0_6,plain,
! [X1,X2] :
( ( ? [X3] : model(X3,X1)
& ! [X4] :
( model(X4,X1)
=> model(X4,X2) )
& ? [X5] :
( model(X5,X2)
& ~ model(X5,X1) ) )
<=> status(X1,X2,wec) ),
inference(fof_simplification,[status(thm)],[wec]) ).
fof(c_0_7,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_8,plain,
! [X36] : model(X36,esk7_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[tautology])]) ).
fof(c_0_9,plain,
! [X25,X26,X27,X29,X30,X31,X33] :
( ( model(esk4_2(X25,X26),X25)
| ~ model(X27,X25)
| ~ model(X29,X26)
| model(X29,X25)
| status(X25,X26,wec) )
& ( ~ model(esk4_2(X25,X26),X26)
| ~ model(X27,X25)
| ~ model(X29,X26)
| model(X29,X25)
| status(X25,X26,wec) )
& ( model(esk5_2(X30,X31),X30)
| ~ status(X30,X31,wec) )
& ( ~ model(X33,X30)
| model(X33,X31)
| ~ status(X30,X31,wec) )
& ( model(esk6_2(X30,X31),X31)
| ~ status(X30,X31,wec) )
& ( ~ model(esk6_2(X30,X31),X30)
| ~ status(X30,X31,wec) ) ),
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_6])])])])])])]) ).
fof(c_0_10,plain,
? [X3,X1,X2] :
( model(X3,X1)
& ~ model(X3,X2)
& ? [X4] : model(X4,X2) ),
inference(fof_simplification,[status(thm)],[non_thm_spt]) ).
fof(c_0_11,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])])])])])])]) ).
cnf(c_0_12,plain,
( status(X1,X2,thm)
| ~ model(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
model(X1,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( model(X4,X1)
| status(X1,X2,wec)
| ~ model(esk4_2(X1,X2),X2)
| ~ model(X3,X1)
| ~ model(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
( model(esk21_0,esk22_0)
& ~ model(esk21_0,esk23_0)
& model(esk24_0,esk23_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_10])])]) ).
fof(c_0_16,negated_conjecture,
~ mighta(wec,thm),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[mighta_wec_thm])]) ).
cnf(c_0_17,plain,
( mighta(X3,X4)
| ~ status(X1,X2,X3)
| ~ status(X1,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
status(X1,esk7_0,thm),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( status(X1,esk7_0,wec)
| model(X2,X1)
| ~ model(X3,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_13]),c_0_13])]) ).
cnf(c_0_20,plain,
model(esk24_0,esk23_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,negated_conjecture,
~ mighta(wec,thm),
inference(fof_nnf,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( mighta(X1,thm)
| ~ status(X2,esk7_0,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( status(esk23_0,esk7_0,wec)
| model(X1,esk23_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
~ mighta(wec,thm),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
~ model(esk21_0,esk23_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,plain,
model(X1,esk23_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_27,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS260+1 : TPTP v8.2.0. Bugfixed v5.4.0.
% 0.13/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n029.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 : Sat May 18 22:21:38 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.46 Running first-order model finding
% 0.21/0.46 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/benchmark/theBenchmark.p
% 0.21/0.48 # Version: 3.1.0
% 0.21/0.48 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.48 # Starting sh5l with 300s (1) cores
% 0.21/0.48 # new_bool_1 with pid 32250 completed with status 0
% 0.21/0.48 # Result found by new_bool_1
% 0.21/0.48 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.48 # Search class: FGHNF-FFSM22-SFFFFFNN
% 0.21/0.48 # partial match(1): FGHNF-FFSF22-SFFFFFNN
% 0.21/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.48 # SAT001_MinMin_p005000_rr_RG with pid 32255 completed with status 0
% 0.21/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.48 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.48 # Search class: FGHNF-FFSM22-SFFFFFNN
% 0.21/0.48 # partial match(1): FGHNF-FFSF22-SFFFFFNN
% 0.21/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.48 # Preprocessing time : 0.001 s
% 0.21/0.48 # Presaturation interreduction done
% 0.21/0.48
% 0.21/0.48 # Proof found!
% 0.21/0.48 # SZS status Theorem
% 0.21/0.48 # SZS output start CNFRefutation
% See solution above
% 0.21/0.48 # Parsed axioms : 33
% 0.21/0.48 # Removed by relevancy pruning/SinE : 23
% 0.21/0.48 # Initial clauses : 28
% 0.21/0.48 # Removed in clause preprocessing : 0
% 0.21/0.48 # Initial clauses in saturation : 28
% 0.21/0.48 # Processed clauses : 82
% 0.21/0.48 # ...of these trivial : 2
% 0.21/0.48 # ...subsumed : 2
% 0.21/0.48 # ...remaining for further processing : 78
% 0.21/0.48 # Other redundant clauses eliminated : 0
% 0.21/0.48 # Clauses deleted for lack of memory : 0
% 0.21/0.48 # Backward-subsumed : 1
% 0.21/0.48 # Backward-rewritten : 2
% 0.21/0.48 # Generated clauses : 79
% 0.21/0.48 # ...of the previous two non-redundant : 64
% 0.21/0.48 # ...aggressively subsumed : 0
% 0.21/0.48 # Contextual simplify-reflections : 0
% 0.21/0.48 # Paramodulations : 79
% 0.21/0.48 # Factorizations : 0
% 0.21/0.48 # NegExts : 0
% 0.21/0.48 # Equation resolutions : 0
% 0.21/0.48 # Disequality decompositions : 0
% 0.21/0.48 # Total rewrite steps : 13
% 0.21/0.48 # ...of those cached : 7
% 0.21/0.48 # Propositional unsat checks : 0
% 0.21/0.48 # Propositional check models : 0
% 0.21/0.48 # Propositional check unsatisfiable : 0
% 0.21/0.48 # Propositional clauses : 0
% 0.21/0.48 # Propositional clauses after purity: 0
% 0.21/0.48 # Propositional unsat core size : 0
% 0.21/0.48 # Propositional preprocessing time : 0.000
% 0.21/0.48 # Propositional encoding time : 0.000
% 0.21/0.48 # Propositional solver time : 0.000
% 0.21/0.48 # Success case prop preproc time : 0.000
% 0.21/0.48 # Success case prop encoding time : 0.000
% 0.21/0.48 # Success case prop solver time : 0.000
% 0.21/0.48 # Current number of processed clauses : 47
% 0.21/0.48 # Positive orientable unit clauses : 13
% 0.21/0.48 # Positive unorientable unit clauses: 0
% 0.21/0.48 # Negative unit clauses : 12
% 0.21/0.48 # Non-unit-clauses : 22
% 0.21/0.48 # Current number of unprocessed clauses: 38
% 0.21/0.48 # ...number of literals in the above : 126
% 0.21/0.48 # Current number of archived formulas : 0
% 0.21/0.48 # Current number of archived clauses : 31
% 0.21/0.48 # Clause-clause subsumption calls (NU) : 81
% 0.21/0.48 # Rec. Clause-clause subsumption calls : 47
% 0.21/0.48 # Non-unit clause-clause subsumptions : 1
% 0.21/0.48 # Unit Clause-clause subsumption calls : 46
% 0.21/0.48 # Rewrite failures with RHS unbound : 0
% 0.21/0.48 # BW rewrite match attempts : 13
% 0.21/0.48 # BW rewrite match successes : 3
% 0.21/0.48 # Condensation attempts : 0
% 0.21/0.48 # Condensation successes : 0
% 0.21/0.48 # Termbank termtop insertions : 2850
% 0.21/0.48 # Search garbage collected termcells : 581
% 0.21/0.48
% 0.21/0.48 # -------------------------------------------------
% 0.21/0.48 # User time : 0.008 s
% 0.21/0.48 # System time : 0.002 s
% 0.21/0.48 # Total time : 0.010 s
% 0.21/0.48 # Maximum resident set size: 1920 pages
% 0.21/0.48
% 0.21/0.48 # -------------------------------------------------
% 0.21/0.48 # User time : 0.011 s
% 0.21/0.48 # System time : 0.003 s
% 0.21/0.48 # Total time : 0.014 s
% 0.21/0.48 # Maximum resident set size: 1740 pages
% 0.21/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------