TSTP Solution File: KRS233+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KRS233+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:12:34 EDT 2024
% Result : Theorem 0.20s 0.59s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 5 unt; 0 def)
% Number of atoms : 69 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 74 ( 30 ~; 27 |; 8 &)
% ( 5 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 12 ( 5 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 : 56 ( 0 sgn 35 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(completeness,axiom,
! [X9,X10] :
( model(X9,X10)
<~> model(X9,not(X10)) ),
file('/export/starexec/sandbox2/tmp/tmp.nEW4zX6G5w/E---3.1_15937.p',completeness) ).
fof(nevera,axiom,
! [X7,X8] :
( ! [X1,X2] :
( status(X1,X2,X7)
=> ~ status(X1,X2,X8) )
<=> nevera(X7,X8) ),
file('/export/starexec/sandbox2/tmp/tmp.nEW4zX6G5w/E---3.1_15937.p',nevera) ).
fof(csa,axiom,
! [X1,X2] :
( ? [X3] :
( model(X3,X1)
& model(X3,not(X2)) )
<=> status(X1,X2,csa) ),
file('/export/starexec/sandbox2/tmp/tmp.nEW4zX6G5w/E---3.1_15937.p',csa) ).
fof(thm,axiom,
! [X1,X2] :
( ! [X3] :
( model(X3,X1)
=> model(X3,X2) )
<=> status(X1,X2,thm) ),
file('/export/starexec/sandbox2/tmp/tmp.nEW4zX6G5w/E---3.1_15937.p',thm) ).
fof(nevera_csa_thm,conjecture,
nevera(csa,thm),
file('/export/starexec/sandbox2/tmp/tmp.nEW4zX6G5w/E---3.1_15937.p',nevera_csa_thm) ).
fof(c_0_5,plain,
! [X9,X10] :
~ ( model(X9,X10)
<=> model(X9,not(X10)) ),
inference(fof_simplification,[status(thm)],[completeness]) ).
fof(c_0_6,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_7,plain,
! [X52,X53] :
( ( ~ model(X52,X53)
| ~ model(X52,not(X53)) )
& ( model(X52,X53)
| model(X52,not(X53)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,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_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,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_6])])])])])])]) ).
cnf(c_0_11,plain,
( ~ model(X1,X2)
| ~ model(X1,not(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( model(esk4_2(X1,X2),not(X2))
| ~ status(X1,X2,csa) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( model(X3,X2)
| ~ status(X1,X2,thm)
| ~ model(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( status(esk1_2(X1,X2),esk2_2(X1,X2),X2)
| nevera(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( ~ status(X1,X2,csa)
| ~ model(esk4_2(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( nevera(X1,thm)
| model(X2,esk2_2(X1,thm))
| ~ model(X2,esk1_2(X1,thm)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_17,negated_conjecture,
~ nevera(csa,thm),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[nevera_csa_thm])]) ).
cnf(c_0_18,plain,
( nevera(X1,thm)
| ~ status(X2,esk2_2(X1,thm),csa)
| ~ model(esk4_2(X2,esk2_2(X1,thm)),esk1_2(X1,thm)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( model(esk4_2(X1,X2),X1)
| ~ status(X1,X2,csa) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_20,negated_conjecture,
~ nevera(csa,thm),
inference(fof_nnf,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
( nevera(X1,thm)
| ~ status(esk1_2(X1,thm),esk2_2(X1,thm),csa) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( status(esk1_2(X1,X2),esk2_2(X1,X2),X1)
| nevera(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,negated_conjecture,
~ nevera(csa,thm),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : KRS233+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n022.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 : Fri May 3 13:41:12 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.nEW4zX6G5w/E---3.1_15937.p
% 0.20/0.59 # Version: 3.1.0
% 0.20/0.59 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.59 # Starting sh5l with 300s (1) cores
% 0.20/0.59 # new_bool_3 with pid 16016 completed with status 0
% 0.20/0.59 # Result found by new_bool_3
% 0.20/0.59 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.59 # Search class: FGHNF-FFSM21-SFFFFFNN
% 0.20/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.59 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.59 # SAT001_MinMin_p005000_rr_RG with pid 16019 completed with status 0
% 0.20/0.59 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.59 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.59 # Search class: FGHNF-FFSM21-SFFFFFNN
% 0.20/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.59 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.59 # Preprocessing time : 0.002 s
% 0.20/0.59 # Presaturation interreduction done
% 0.20/0.59
% 0.20/0.59 # Proof found!
% 0.20/0.59 # SZS status Theorem
% 0.20/0.59 # SZS output start CNFRefutation
% See solution above
% 0.20/0.59 # Parsed axioms : 33
% 0.20/0.59 # Removed by relevancy pruning/SinE : 21
% 0.20/0.59 # Initial clauses : 29
% 0.20/0.59 # Removed in clause preprocessing : 0
% 0.20/0.59 # Initial clauses in saturation : 29
% 0.20/0.59 # Processed clauses : 1231
% 0.20/0.59 # ...of these trivial : 56
% 0.20/0.59 # ...subsumed : 743
% 0.20/0.59 # ...remaining for further processing : 432
% 0.20/0.59 # Other redundant clauses eliminated : 0
% 0.20/0.59 # Clauses deleted for lack of memory : 0
% 0.20/0.59 # Backward-subsumed : 3
% 0.20/0.59 # Backward-rewritten : 2
% 0.20/0.59 # Generated clauses : 5554
% 0.20/0.59 # ...of the previous two non-redundant : 4055
% 0.20/0.59 # ...aggressively subsumed : 0
% 0.20/0.59 # Contextual simplify-reflections : 0
% 0.20/0.59 # Paramodulations : 5552
% 0.20/0.59 # Factorizations : 2
% 0.20/0.59 # NegExts : 0
% 0.20/0.59 # Equation resolutions : 0
% 0.20/0.59 # Disequality decompositions : 0
% 0.20/0.59 # Total rewrite steps : 1553
% 0.20/0.59 # ...of those cached : 1456
% 0.20/0.59 # Propositional unsat checks : 0
% 0.20/0.59 # Propositional check models : 0
% 0.20/0.59 # Propositional check unsatisfiable : 0
% 0.20/0.59 # Propositional clauses : 0
% 0.20/0.59 # Propositional clauses after purity: 0
% 0.20/0.59 # Propositional unsat core size : 0
% 0.20/0.59 # Propositional preprocessing time : 0.000
% 0.20/0.59 # Propositional encoding time : 0.000
% 0.20/0.59 # Propositional solver time : 0.000
% 0.20/0.59 # Success case prop preproc time : 0.000
% 0.20/0.59 # Success case prop encoding time : 0.000
% 0.20/0.59 # Success case prop solver time : 0.000
% 0.20/0.59 # Current number of processed clauses : 400
% 0.20/0.59 # Positive orientable unit clauses : 84
% 0.20/0.59 # Positive unorientable unit clauses: 0
% 0.20/0.59 # Negative unit clauses : 35
% 0.20/0.59 # Non-unit-clauses : 281
% 0.20/0.59 # Current number of unprocessed clauses: 2845
% 0.20/0.59 # ...number of literals in the above : 6993
% 0.20/0.59 # Current number of archived formulas : 0
% 0.20/0.59 # Current number of archived clauses : 32
% 0.20/0.59 # Clause-clause subsumption calls (NU) : 6690
% 0.20/0.59 # Rec. Clause-clause subsumption calls : 5503
% 0.20/0.59 # Non-unit clause-clause subsumptions : 73
% 0.20/0.59 # Unit Clause-clause subsumption calls : 477
% 0.20/0.59 # Rewrite failures with RHS unbound : 0
% 0.20/0.59 # BW rewrite match attempts : 133
% 0.20/0.59 # BW rewrite match successes : 2
% 0.20/0.59 # Condensation attempts : 0
% 0.20/0.59 # Condensation successes : 0
% 0.20/0.59 # Termbank termtop insertions : 58169
% 0.20/0.59 # Search garbage collected termcells : 535
% 0.20/0.59
% 0.20/0.59 # -------------------------------------------------
% 0.20/0.59 # User time : 0.085 s
% 0.20/0.59 # System time : 0.005 s
% 0.20/0.59 # Total time : 0.090 s
% 0.20/0.59 # Maximum resident set size: 1860 pages
% 0.20/0.59
% 0.20/0.59 # -------------------------------------------------
% 0.20/0.59 # User time : 0.086 s
% 0.20/0.59 # System time : 0.008 s
% 0.20/0.59 # Total time : 0.094 s
% 0.20/0.59 # Maximum resident set size: 1728 pages
% 0.20/0.59 % E---3.1 exiting
% 0.20/0.59 % E exiting
%------------------------------------------------------------------------------