TSTP Solution File: KRS200+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : KRS200+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:27 EDT 2024
% Result : Theorem 0.22s 0.52s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 12 unt; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 68 ( 29 ~; 19 |; 14 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 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 : 62 ( 7 sgn 29 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(non_thm_spt,axiom,
? [X3,X1,X2] :
( model(X3,X1)
& ~ model(X3,X2)
& ? [X4] : model(X4,X2) ),
file('/export/starexec/sandbox/tmp/tmp.cbLj3tiemQ/E---3.1_6314.p',non_thm_spt) ).
fof(nota,axiom,
! [X7,X8] :
( ? [X1,X2] :
( status(X1,X2,X7)
& ~ status(X1,X2,X8) )
<=> nota(X7,X8) ),
file('/export/starexec/sandbox/tmp/tmp.cbLj3tiemQ/E---3.1_6314.p',nota) ).
fof(unp,axiom,
! [X1,X2] :
( ( ~ ? [X3] : model(X3,X1)
=> ~ ? [X4] : model(X4,X2) )
<=> status(X1,X2,unp) ),
file('/export/starexec/sandbox/tmp/tmp.cbLj3tiemQ/E---3.1_6314.p',unp) ).
fof(nota_unp_thm,conjecture,
nota(unp,thm),
file('/export/starexec/sandbox/tmp/tmp.cbLj3tiemQ/E---3.1_6314.p',nota_unp_thm) ).
fof(thm,axiom,
! [X1,X2] :
( ! [X3] :
( model(X3,X1)
=> model(X3,X2) )
<=> status(X1,X2,thm) ),
file('/export/starexec/sandbox/tmp/tmp.cbLj3tiemQ/E---3.1_6314.p',thm) ).
fof(contradiction,axiom,
? [X10] :
! [X9] : ~ model(X9,X10),
file('/export/starexec/sandbox/tmp/tmp.cbLj3tiemQ/E---3.1_6314.p',contradiction) ).
fof(c_0_6,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_7,plain,
! [X7,X8] :
( ? [X1,X2] :
( status(X1,X2,X7)
& ~ status(X1,X2,X8) )
<=> nota(X7,X8) ),
inference(fof_simplification,[status(thm)],[nota]) ).
fof(c_0_8,plain,
! [X25,X26,X27,X29,X30,X32] :
( ( ~ model(X27,X25)
| status(X25,X26,unp) )
& ( model(esk4_2(X25,X26),X26)
| status(X25,X26,unp) )
& ( ~ status(X29,X30,unp)
| model(esk5_2(X29,X30),X29)
| ~ model(X32,X30) ) ),
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)],[unp])])])])])])]) ).
fof(c_0_9,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_6])])]) ).
fof(c_0_10,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_7])])])])])])]) ).
cnf(c_0_11,plain,
( status(X2,X3,unp)
| ~ model(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
model(esk23_0,esk22_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,negated_conjecture,
~ nota(unp,thm),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[nota_unp_thm])]) ).
fof(c_0_14,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])])])])])])]) ).
cnf(c_0_15,plain,
( status(X1,X2,X4)
| nota(X3,X4)
| ~ status(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
status(esk22_0,X1,unp),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_17,negated_conjecture,
~ nota(unp,thm),
inference(fof_nnf,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
? [X10] :
! [X9] : ~ model(X9,X10),
inference(fof_simplification,[status(thm)],[contradiction]) ).
cnf(c_0_19,plain,
( model(X3,X2)
| ~ status(X1,X2,thm)
| ~ model(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( nota(unp,X1)
| status(esk22_0,X2,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
~ nota(unp,thm),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_22,plain,
! [X39] : ~ model(X39,esk10_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_18])])]) ).
cnf(c_0_23,plain,
( model(X1,X2)
| ~ model(X1,esk22_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_24,plain,
~ model(X1,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_25,plain,
model(esk23_0,X1),
inference(spm,[status(thm)],[c_0_23,c_0_12]) ).
cnf(c_0_26,plain,
$false,
inference(spm,[status(thm)],[c_0_24,c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : KRS200+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n024.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 13:43:20 EDT 2024
% 0.15/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.cbLj3tiemQ/E---3.1_6314.p
% 0.22/0.52 # Version: 3.1.0
% 0.22/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # sh5l with pid 6443 completed with status 0
% 0.22/0.52 # Result found by sh5l
% 0.22/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.52 # Search class: FGHNF-FFSM22-SFFFFFNN
% 0.22/0.52 # partial match(1): FGHNF-FFSF22-SFFFFFNN
% 0.22/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.52 # SAT001_MinMin_p005000_rr_RG with pid 6446 completed with status 0
% 0.22/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.52 # Search class: FGHNF-FFSM22-SFFFFFNN
% 0.22/0.52 # partial match(1): FGHNF-FFSF22-SFFFFFNN
% 0.22/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.52 # Preprocessing time : 0.002 s
% 0.22/0.52 # Presaturation interreduction done
% 0.22/0.52
% 0.22/0.52 # Proof found!
% 0.22/0.52 # SZS status Theorem
% 0.22/0.52 # SZS output start CNFRefutation
% See solution above
% 0.22/0.52 # Parsed axioms : 33
% 0.22/0.52 # Removed by relevancy pruning/SinE : 23
% 0.22/0.52 # Initial clauses : 25
% 0.22/0.52 # Removed in clause preprocessing : 0
% 0.22/0.52 # Initial clauses in saturation : 25
% 0.22/0.52 # Processed clauses : 73
% 0.22/0.52 # ...of these trivial : 1
% 0.22/0.52 # ...subsumed : 2
% 0.22/0.52 # ...remaining for further processing : 70
% 0.22/0.52 # Other redundant clauses eliminated : 0
% 0.22/0.52 # Clauses deleted for lack of memory : 0
% 0.22/0.52 # Backward-subsumed : 0
% 0.22/0.52 # Backward-rewritten : 1
% 0.22/0.52 # Generated clauses : 63
% 0.22/0.52 # ...of the previous two non-redundant : 54
% 0.22/0.52 # ...aggressively subsumed : 0
% 0.22/0.52 # Contextual simplify-reflections : 0
% 0.22/0.52 # Paramodulations : 63
% 0.22/0.52 # Factorizations : 0
% 0.22/0.52 # NegExts : 0
% 0.22/0.52 # Equation resolutions : 0
% 0.22/0.52 # Disequality decompositions : 0
% 0.22/0.52 # Total rewrite steps : 7
% 0.22/0.52 # ...of those cached : 0
% 0.22/0.52 # Propositional unsat checks : 0
% 0.22/0.52 # Propositional check models : 0
% 0.22/0.52 # Propositional check unsatisfiable : 0
% 0.22/0.52 # Propositional clauses : 0
% 0.22/0.52 # Propositional clauses after purity: 0
% 0.22/0.52 # Propositional unsat core size : 0
% 0.22/0.52 # Propositional preprocessing time : 0.000
% 0.22/0.52 # Propositional encoding time : 0.000
% 0.22/0.52 # Propositional solver time : 0.000
% 0.22/0.52 # Success case prop preproc time : 0.000
% 0.22/0.52 # Success case prop encoding time : 0.000
% 0.22/0.52 # Success case prop solver time : 0.000
% 0.22/0.52 # Current number of processed clauses : 44
% 0.22/0.52 # Positive orientable unit clauses : 21
% 0.22/0.52 # Positive unorientable unit clauses: 0
% 0.22/0.52 # Negative unit clauses : 8
% 0.22/0.52 # Non-unit-clauses : 15
% 0.22/0.52 # Current number of unprocessed clauses: 31
% 0.22/0.52 # ...number of literals in the above : 68
% 0.22/0.52 # Current number of archived formulas : 0
% 0.22/0.52 # Current number of archived clauses : 26
% 0.22/0.52 # Clause-clause subsumption calls (NU) : 23
% 0.22/0.52 # Rec. Clause-clause subsumption calls : 21
% 0.22/0.52 # Non-unit clause-clause subsumptions : 0
% 0.22/0.52 # Unit Clause-clause subsumption calls : 31
% 0.22/0.52 # Rewrite failures with RHS unbound : 0
% 0.22/0.52 # BW rewrite match attempts : 19
% 0.22/0.52 # BW rewrite match successes : 1
% 0.22/0.52 # Condensation attempts : 0
% 0.22/0.52 # Condensation successes : 0
% 0.22/0.52 # Termbank termtop insertions : 2279
% 0.22/0.52 # Search garbage collected termcells : 522
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.006 s
% 0.22/0.52 # System time : 0.004 s
% 0.22/0.52 # Total time : 0.010 s
% 0.22/0.52 # Maximum resident set size: 1888 pages
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.007 s
% 0.22/0.52 # System time : 0.007 s
% 0.22/0.52 # Total time : 0.014 s
% 0.22/0.52 # Maximum resident set size: 1752 pages
% 0.22/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------