TSTP Solution File: KRS128+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : KRS128+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:28 EDT 2024
% Result : Unsatisfiable 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 4 unt; 0 def)
% Number of atoms : 88 ( 0 equ)
% Maximal formula atoms : 30 ( 3 avg)
% Number of connectives : 110 ( 45 ~; 44 |; 15 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 36 ( 2 sgn 18 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_9,axiom,
! [X1] :
( ca_Cx4xcomp(X1)
<=> ~ ? [X2] : ra_Px4(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).
fof(axiom_8,axiom,
! [X1] :
( ca_Cx4(X1)
<=> ? [X3] : ra_Px4(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
fof(axiom_2,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ? [X2] :
( rr(X1,X2)
& cexcomp(X2) )
& ! [X2] :
( rr(X1,X2)
=> cd(X2) )
& ! [X2] :
( rr(X1,X2)
=> ca_Cx4(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_10,axiom,
! [X1] :
( ca_Cx4xcomp(X1)
<=> ( cd(X1)
& cexcomp(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_10) ).
fof(axiom_11,axiom,
cUnsatisfiable(i2003_11_14_17_22_31584),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_11) ).
fof(c_0_5,plain,
! [X35,X36,X37] :
( ( ~ ca_Cx4xcomp(X35)
| ~ ra_Px4(X35,X36) )
& ( ra_Px4(X37,esk9_1(X37))
| ca_Cx4xcomp(X37) ) ),
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)],[axiom_9])])])])])]) ).
fof(c_0_6,plain,
! [X31,X33,X34] :
( ( ~ ca_Cx4(X31)
| ra_Px4(X31,esk8_1(X31)) )
& ( ~ ra_Px4(X33,X34)
| ca_Cx4(X33) ) ),
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)],[axiom_8])])])])])]) ).
fof(c_0_7,plain,
! [X6,X8,X9,X10,X11] :
( ( rr(X6,esk1_1(X6))
| ~ cUnsatisfiable(X6) )
& ( cexcomp(esk1_1(X6))
| ~ cUnsatisfiable(X6) )
& ( ~ rr(X6,X8)
| cd(X8)
| ~ cUnsatisfiable(X6) )
& ( ~ rr(X6,X9)
| ca_Cx4(X9)
| ~ cUnsatisfiable(X6) )
& ( rr(X10,esk3_1(X10))
| rr(X10,esk2_1(X10))
| ~ rr(X10,X11)
| ~ cexcomp(X11)
| cUnsatisfiable(X10) )
& ( ~ ca_Cx4(esk3_1(X10))
| rr(X10,esk2_1(X10))
| ~ rr(X10,X11)
| ~ cexcomp(X11)
| cUnsatisfiable(X10) )
& ( rr(X10,esk3_1(X10))
| ~ cd(esk2_1(X10))
| ~ rr(X10,X11)
| ~ cexcomp(X11)
| cUnsatisfiable(X10) )
& ( ~ ca_Cx4(esk3_1(X10))
| ~ cd(esk2_1(X10))
| ~ rr(X10,X11)
| ~ cexcomp(X11)
| cUnsatisfiable(X10) ) ),
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)],[axiom_2])])])])])])]) ).
cnf(c_0_8,plain,
( ~ ca_Cx4xcomp(X1)
| ~ ra_Px4(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ra_Px4(X1,esk8_1(X1))
| ~ ca_Cx4(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ca_Cx4(X2)
| ~ rr(X1,X2)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ~ ca_Cx4xcomp(X1)
| ~ ca_Cx4(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( ca_Cx4(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_14,plain,
! [X39] :
( ( cd(X39)
| ~ ca_Cx4xcomp(X39) )
& ( cexcomp(X39)
| ~ ca_Cx4xcomp(X39) )
& ( ~ cd(X39)
| ~ cexcomp(X39)
| ca_Cx4xcomp(X39) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_10])])])]) ).
cnf(c_0_15,plain,
( cd(X2)
| ~ rr(X1,X2)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
( ~ ca_Cx4xcomp(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( ca_Cx4xcomp(X1)
| ~ cd(X1)
| ~ cexcomp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
( cexcomp(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,plain,
( cd(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_20,plain,
cUnsatisfiable(i2003_11_14_17_22_31584),
inference(split_conjunct,[status(thm)],[axiom_11]) ).
cnf(c_0_21,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]) ).
cnf(c_0_22,plain,
$false,
inference(sr,[status(thm)],[c_0_20,c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : KRS128+1 : TPTP v8.2.0. Released v3.1.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n028.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:17:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.50 Running first-order model finding
% 0.22/0.50 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.22/0.51 # Version: 3.1.0
% 0.22/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 16252 completed with status 0
% 0.22/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51 # No SInE strategy applied
% 0.22/0.51 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.22/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.51 # Starting sh5l with 136s (1) cores
% 0.22/0.51 # SAT001_MinMin_p005000_rr_RG with pid 16265 completed with status 0
% 0.22/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51 # No SInE strategy applied
% 0.22/0.51 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.22/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.51 # Preprocessing time : 0.001 s
% 0.22/0.51 # Presaturation interreduction done
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Unsatisfiable
% 0.22/0.51 # SZS output start CNFRefutation
% See solution above
% 0.22/0.51 # Parsed axioms : 12
% 0.22/0.51 # Removed by relevancy pruning/SinE : 0
% 0.22/0.51 # Initial clauses : 29
% 0.22/0.51 # Removed in clause preprocessing : 1
% 0.22/0.51 # Initial clauses in saturation : 28
% 0.22/0.51 # Processed clauses : 60
% 0.22/0.51 # ...of these trivial : 0
% 0.22/0.51 # ...subsumed : 0
% 0.22/0.51 # ...remaining for further processing : 60
% 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 : 7
% 0.22/0.51 # Backward-rewritten : 0
% 0.22/0.51 # Generated clauses : 20
% 0.22/0.51 # ...of the previous two non-redundant : 9
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 2
% 0.22/0.51 # Paramodulations : 19
% 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 : 0
% 0.22/0.51 # ...of those cached : 0
% 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 : 24
% 0.22/0.51 # Positive orientable unit clauses : 0
% 0.22/0.51 # Positive unorientable unit clauses: 0
% 0.22/0.51 # Negative unit clauses : 2
% 0.22/0.51 # Non-unit-clauses : 22
% 0.22/0.51 # Current number of unprocessed clauses: 5
% 0.22/0.51 # ...number of literals in the above : 22
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 37
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 340
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 159
% 0.22/0.51 # Non-unit clause-clause subsumptions : 2
% 0.22/0.51 # Unit Clause-clause subsumption calls : 7
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 0
% 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 : 1993
% 0.22/0.51 # Search garbage collected termcells : 453
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.008 s
% 0.22/0.51 # System time : 0.002 s
% 0.22/0.51 # Total time : 0.010 s
% 0.22/0.51 # Maximum resident set size: 1736 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.022 s
% 0.22/0.51 # System time : 0.009 s
% 0.22/0.51 # Total time : 0.031 s
% 0.22/0.51 # Maximum resident set size: 1696 pages
% 0.22/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------