TSTP Solution File: KRS233+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : KRS233+1 : TPTP v8.2.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:17:58 EDT 2024
% Result : Theorem 0.96s 0.61s
% Output : CNFRefutation 0.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 6 unt; 0 def)
% Number of atoms : 69 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 69 ( 26 ~; 26 |; 8 &)
% ( 5 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 12 ( 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 : 54 ( 0 sgn 35 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(nevera,axiom,
! [X7,X8] :
( ! [X1,X2] :
( status(X1,X2,X7)
=> ~ status(X1,X2,X8) )
<=> nevera(X7,X8) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',nevera) ).
fof(completeness,axiom,
! [X9,X10] :
( model(X9,X10)
<~> model(X9,not(X10)) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',completeness) ).
fof(csa,axiom,
! [X1,X2] :
( ? [X3] :
( model(X3,X1)
& model(X3,not(X2)) )
<=> status(X1,X2,csa) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',csa) ).
fof(thm,axiom,
! [X1,X2] :
( ! [X3] :
( model(X3,X1)
=> model(X3,X2) )
<=> status(X1,X2,thm) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',thm) ).
fof(nevera_csa_thm,conjecture,
nevera(csa,thm),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nevera_csa_thm) ).
fof(c_0_5,plain,
! [X7,X8] :
( ! [X1,X2] :
( status(X1,X2,X7)
=> ~ status(X1,X2,X8) )
<=> nevera(X7,X8) ),
inference(fof_simplification,[status(thm)],[nevera]) ).
fof(c_0_6,plain,
! [X9,X10] :
~ ( model(X9,X10)
<=> model(X9,not(X10)) ),
inference(fof_simplification,[status(thm)],[completeness]) ).
fof(c_0_7,plain,
! [X25,X26,X27,X28,X29] :
( ( ~ model(X27,X25)
| ~ model(X27,not(X26))
| status(X25,X26,csa) )
& ( model(esk4_2(X28,X29),X28)
| ~ status(X28,X29,csa) )
& ( model(esk4_2(X28,X29),not(X29))
| ~ status(X28,X29,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_8,plain,
! [X11,X12,X15,X16,X17,X18] :
( ( status(esk1_2(X11,X12),esk2_2(X11,X12),X11)
| nevera(X11,X12) )
& ( status(esk1_2(X11,X12),esk2_2(X11,X12),X12)
| nevera(X11,X12) )
& ( ~ nevera(X15,X16)
| ~ status(X17,X18,X15)
| ~ status(X17,X18,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_5])])])])])])]) ).
fof(c_0_9,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_10,negated_conjecture,
~ nevera(csa,thm),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[nevera_csa_thm])]) ).
fof(c_0_11,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_6])])]) ).
cnf(c_0_12,plain,
( model(esk4_2(X1,X2),not(X2))
| ~ status(X1,X2,csa) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( status(esk1_2(X1,X2),esk2_2(X1,X2),X1)
| nevera(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( model(X3,X2)
| ~ status(X1,X2,thm)
| ~ model(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( status(esk1_2(X1,X2),esk2_2(X1,X2),X2)
| nevera(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( model(esk4_2(X1,X2),X1)
| ~ status(X1,X2,csa) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_17,negated_conjecture,
~ nevera(csa,thm),
inference(fof_nnf,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( ~ model(X1,X2)
| ~ model(X1,not(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( nevera(csa,X1)
| model(esk4_2(esk1_2(csa,X1),esk2_2(csa,X1)),not(esk2_2(csa,X1))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,plain,
( nevera(X1,thm)
| model(X2,esk2_2(X1,thm))
| ~ model(X2,esk1_2(X1,thm)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( nevera(csa,X1)
| model(esk4_2(esk1_2(csa,X1),esk2_2(csa,X1)),esk1_2(csa,X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_22,negated_conjecture,
~ nevera(csa,thm),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( nevera(csa,X1)
| ~ model(esk4_2(esk1_2(csa,X1),esk2_2(csa,X1)),esk2_2(csa,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
model(esk4_2(esk1_2(csa,thm),esk2_2(csa,thm)),esk2_2(csa,thm)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_25,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS233+1 : TPTP v8.2.0. Bugfixed v5.4.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n009.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.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat May 18 22:20:53 EDT 2024
% 0.21/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/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/benchmark/theBenchmark.p
% 0.96/0.61 # Version: 3.1.0
% 0.96/0.61 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.96/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.96/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.96/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.96/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.96/0.61 # Starting sh5l with 300s (1) cores
% 0.96/0.61 # sh5l with pid 28473 completed with status 0
% 0.96/0.61 # Result found by sh5l
% 0.96/0.61 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.96/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.96/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.96/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.96/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.96/0.61 # Starting sh5l with 300s (1) cores
% 0.96/0.61 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.96/0.61 # Search class: FGHNF-FFMM21-SFFFFFNN
% 0.96/0.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.96/0.61 # Starting G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S with 131s (1) cores
% 0.96/0.61 # G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S with pid 28476 completed with status 0
% 0.96/0.61 # Result found by G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S
% 0.96/0.61 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.96/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.96/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.96/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.96/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.96/0.61 # Starting sh5l with 300s (1) cores
% 0.96/0.61 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.96/0.61 # Search class: FGHNF-FFMM21-SFFFFFNN
% 0.96/0.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.96/0.61 # Starting G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S with 131s (1) cores
% 0.96/0.61 # Preprocessing time : 0.002 s
% 0.96/0.61 # Presaturation interreduction done
% 0.96/0.61
% 0.96/0.61 # Proof found!
% 0.96/0.61 # SZS status Theorem
% 0.96/0.61 # SZS output start CNFRefutation
% See solution above
% 0.96/0.61 # Parsed axioms : 33
% 0.96/0.61 # Removed by relevancy pruning/SinE : 19
% 0.96/0.61 # Initial clauses : 37
% 0.96/0.61 # Removed in clause preprocessing : 0
% 0.96/0.61 # Initial clauses in saturation : 37
% 0.96/0.61 # Processed clauses : 837
% 0.96/0.61 # ...of these trivial : 54
% 0.96/0.61 # ...subsumed : 145
% 0.96/0.61 # ...remaining for further processing : 638
% 0.96/0.61 # Other redundant clauses eliminated : 0
% 0.96/0.61 # Clauses deleted for lack of memory : 0
% 0.96/0.61 # Backward-subsumed : 3
% 0.96/0.61 # Backward-rewritten : 3
% 0.96/0.61 # Generated clauses : 3652
% 0.96/0.61 # ...of the previous two non-redundant : 3060
% 0.96/0.61 # ...aggressively subsumed : 0
% 0.96/0.61 # Contextual simplify-reflections : 2
% 0.96/0.61 # Paramodulations : 3652
% 0.96/0.61 # Factorizations : 0
% 0.96/0.61 # NegExts : 0
% 0.96/0.61 # Equation resolutions : 0
% 0.96/0.61 # Disequality decompositions : 0
% 0.96/0.61 # Total rewrite steps : 659
% 0.96/0.61 # ...of those cached : 450
% 0.96/0.61 # Propositional unsat checks : 0
% 0.96/0.61 # Propositional check models : 0
% 0.96/0.61 # Propositional check unsatisfiable : 0
% 0.96/0.61 # Propositional clauses : 0
% 0.96/0.61 # Propositional clauses after purity: 0
% 0.96/0.61 # Propositional unsat core size : 0
% 0.96/0.61 # Propositional preprocessing time : 0.000
% 0.96/0.61 # Propositional encoding time : 0.000
% 0.96/0.61 # Propositional solver time : 0.000
% 0.96/0.61 # Success case prop preproc time : 0.000
% 0.96/0.61 # Success case prop encoding time : 0.000
% 0.96/0.61 # Success case prop solver time : 0.000
% 0.96/0.61 # Current number of processed clauses : 597
% 0.96/0.61 # Positive orientable unit clauses : 157
% 0.96/0.61 # Positive unorientable unit clauses: 0
% 0.96/0.61 # Negative unit clauses : 40
% 0.96/0.61 # Non-unit-clauses : 400
% 0.96/0.61 # Current number of unprocessed clauses: 2226
% 0.96/0.61 # ...number of literals in the above : 4983
% 0.96/0.61 # Current number of archived formulas : 0
% 0.96/0.61 # Current number of archived clauses : 41
% 0.96/0.61 # Clause-clause subsumption calls (NU) : 12085
% 0.96/0.61 # Rec. Clause-clause subsumption calls : 9247
% 0.96/0.61 # Non-unit clause-clause subsumptions : 145
% 0.96/0.61 # Unit Clause-clause subsumption calls : 1990
% 0.96/0.61 # Rewrite failures with RHS unbound : 0
% 0.96/0.61 # BW rewrite match attempts : 283
% 0.96/0.61 # BW rewrite match successes : 3
% 0.96/0.61 # Condensation attempts : 0
% 0.96/0.61 # Condensation successes : 0
% 0.96/0.61 # Termbank termtop insertions : 48257
% 0.96/0.61 # Search garbage collected termcells : 688
% 0.96/0.61
% 0.96/0.61 # -------------------------------------------------
% 0.96/0.61 # User time : 0.098 s
% 0.96/0.61 # System time : 0.005 s
% 0.96/0.61 # Total time : 0.103 s
% 0.96/0.61 # Maximum resident set size: 1864 pages
% 0.96/0.61
% 0.96/0.61 # -------------------------------------------------
% 0.96/0.61 # User time : 0.101 s
% 0.96/0.61 # System time : 0.006 s
% 0.96/0.61 # Total time : 0.107 s
% 0.96/0.61 # Maximum resident set size: 1744 pages
% 0.96/0.61 % E---3.1 exiting
%------------------------------------------------------------------------------