TSTP Solution File: KRS108+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : KRS108+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:01 EDT 2024
% Result : Unsatisfiable 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 4 unt; 0 def)
% Number of atoms : 123 ( 6 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 147 ( 60 ~; 56 |; 23 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-1 aty)
% Number of variables : 56 ( 2 sgn 28 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_15,axiom,
! [X4] :
( ca_Ax14(X4)
<=> ( ? [X5] :
( rr(X4,X5)
& cp1(X5) )
& ! [X6,X7] :
( ( rr(X4,X6)
& rr(X4,X7) )
=> X6 = X7 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zvE8Zr8PnJ/E---3.1_30014.p',axiom_15) ).
fof(axiom_25,axiom,
! [X4,X5] :
( rinvR(X4,X5)
<=> rr(X5,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.zvE8Zr8PnJ/E---3.1_30014.p',axiom_25) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rinvR(X4,X5)
& ca_Ax14(X5) )
& cp2(X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zvE8Zr8PnJ/E---3.1_30014.p',axiom_2) ).
fof(axiom_6,axiom,
! [X4] :
( cp2xcomp(X4)
<=> ~ ? [X5] : ra_Px5(X4,X5) ),
file('/export/starexec/sandbox2/tmp/tmp.zvE8Zr8PnJ/E---3.1_30014.p',axiom_6) ).
fof(axiom_4,axiom,
! [X4] :
( cp2(X4)
<=> ? [X6] : ra_Px5(X4,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.zvE8Zr8PnJ/E---3.1_30014.p',axiom_4) ).
fof(axiom_16,axiom,
! [X4] :
( ca_Cx1(X4)
<=> ( cp2xcomp(X4)
& cp5xcomp(X4)
& cp3xcomp(X4)
& cp4xcomp(X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zvE8Zr8PnJ/E---3.1_30014.p',axiom_16) ).
fof(axiom_3,axiom,
! [X4] :
( cp1(X4)
=> ca_Cx1(X4) ),
file('/export/starexec/sandbox2/tmp/tmp.zvE8Zr8PnJ/E---3.1_30014.p',axiom_3) ).
fof(axiom_26,axiom,
cUnsatisfiable(i2003_11_14_17_21_04740),
file('/export/starexec/sandbox2/tmp/tmp.zvE8Zr8PnJ/E---3.1_30014.p',axiom_26) ).
fof(c_0_8,plain,
! [X146,X148,X149,X150,X151] :
( ( rr(X146,esk10_1(X146))
| ~ ca_Ax14(X146) )
& ( cp1(esk10_1(X146))
| ~ ca_Ax14(X146) )
& ( ~ rr(X146,X148)
| ~ rr(X146,X149)
| X148 = X149
| ~ ca_Ax14(X146) )
& ( rr(X150,esk11_1(X150))
| ~ rr(X150,X151)
| ~ cp1(X151)
| ca_Ax14(X150) )
& ( rr(X150,esk12_1(X150))
| ~ rr(X150,X151)
| ~ cp1(X151)
| ca_Ax14(X150) )
& ( esk11_1(X150) != esk12_1(X150)
| ~ rr(X150,X151)
| ~ cp1(X151)
| ca_Ax14(X150) ) ),
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_15])])])])])])]) ).
fof(c_0_9,plain,
! [X181,X182] :
( ( ~ rinvR(X181,X182)
| rr(X182,X181) )
& ( ~ rr(X182,X181)
| rinvR(X181,X182) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_25])])]) ).
fof(c_0_10,plain,
! [X106,X108,X109] :
( ( rinvR(X106,esk1_1(X106))
| ~ cUnsatisfiable(X106) )
& ( ca_Ax14(esk1_1(X106))
| ~ cUnsatisfiable(X106) )
& ( cp2(X106)
| ~ cUnsatisfiable(X106) )
& ( ~ rinvR(X108,X109)
| ~ ca_Ax14(X109)
| ~ cp2(X108)
| cUnsatisfiable(X108) ) ),
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])])])])])])]) ).
fof(c_0_11,plain,
! [X116,X117,X118] :
( ( ~ cp2xcomp(X116)
| ~ ra_Px5(X116,X117) )
& ( ra_Px5(X118,esk3_1(X118))
| cp2xcomp(X118) ) ),
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_6])])])])])]) ).
fof(c_0_12,plain,
! [X111,X113,X114] :
( ( ~ cp2(X111)
| ra_Px5(X111,esk2_1(X111)) )
& ( ~ ra_Px5(X113,X114)
| cp2(X113) ) ),
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_4])])])])])]) ).
cnf(c_0_13,plain,
( X2 = X3
| ~ rr(X1,X2)
| ~ rr(X1,X3)
| ~ ca_Ax14(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( rr(X1,esk10_1(X1))
| ~ ca_Ax14(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( rr(X2,X1)
| ~ rinvR(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( rinvR(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( ~ cp2xcomp(X1)
| ~ ra_Px5(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ra_Px5(X1,esk2_1(X1))
| ~ cp2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_19,plain,
! [X154] :
( ( cp2xcomp(X154)
| ~ ca_Cx1(X154) )
& ( cp5xcomp(X154)
| ~ ca_Cx1(X154) )
& ( cp3xcomp(X154)
| ~ ca_Cx1(X154) )
& ( cp4xcomp(X154)
| ~ ca_Cx1(X154) )
& ( ~ cp2xcomp(X154)
| ~ cp5xcomp(X154)
| ~ cp3xcomp(X154)
| ~ cp4xcomp(X154)
| ca_Cx1(X154) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_16])])])]) ).
cnf(c_0_20,plain,
( X1 = esk10_1(X2)
| ~ rr(X2,X1)
| ~ ca_Ax14(X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,plain,
( rr(esk1_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( ca_Ax14(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,plain,
( ~ cp2xcomp(X1)
| ~ cp2(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( cp2xcomp(X1)
| ~ ca_Cx1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_25,plain,
! [X110] :
( ~ cp1(X110)
| ca_Cx1(X110) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])]) ).
cnf(c_0_26,plain,
( cp1(esk10_1(X1))
| ~ ca_Ax14(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,plain,
( esk10_1(esk1_1(X1)) = X1
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_28,plain,
( ~ cp2(X1)
| ~ ca_Cx1(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( cp2(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,plain,
( ca_Cx1(X1)
| ~ cp1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
( cp1(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_22]) ).
cnf(c_0_32,plain,
( ~ ca_Cx1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
cUnsatisfiable(i2003_11_14_17_21_04740),
inference(split_conjunct,[status(thm)],[axiom_26]) ).
cnf(c_0_34,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_35,plain,
$false,
inference(sr,[status(thm)],[c_0_33,c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS108+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 13:34:46 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 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/tmp/tmp.zvE8Zr8PnJ/E---3.1_30014.p
% 0.21/0.50 # Version: 3.1.0
% 0.21/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # sh5l with pid 30095 completed with status 8
% 0.21/0.50 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 30092 completed with status 0
% 0.21/0.50 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FGHSF-FFMF11-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 811s (1) cores
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.50 # Starting sh5l with 136s (1) cores
% 0.21/0.50 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 30111 completed with status 0
% 0.21/0.50 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FGHSF-FFMF11-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 811s (1) cores
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.50 # Preprocessing time : 0.003 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Unsatisfiable
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 66
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 100
% 0.21/0.50 # Removed in clause preprocessing : 40
% 0.21/0.50 # Initial clauses in saturation : 60
% 0.21/0.50 # Processed clauses : 158
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 5
% 0.21/0.50 # ...remaining for further processing : 153
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 8
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 78
% 0.21/0.50 # ...of the previous two non-redundant : 46
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 5
% 0.21/0.50 # Paramodulations : 77
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 0
% 0.21/0.50 # ...of those cached : 0
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 84
% 0.21/0.50 # Positive orientable unit clauses : 3
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 3
% 0.21/0.50 # Non-unit-clauses : 78
% 0.21/0.50 # Current number of unprocessed clauses: 8
% 0.21/0.50 # ...number of literals in the above : 29
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 70
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 2141
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 1358
% 0.21/0.50 # Non-unit clause-clause subsumptions : 10
% 0.21/0.50 # Unit Clause-clause subsumption calls : 83
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 0
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 7191
% 0.21/0.50 # Search garbage collected termcells : 1641
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.012 s
% 0.21/0.50 # System time : 0.005 s
% 0.21/0.50 # Total time : 0.017 s
% 0.21/0.50 # Maximum resident set size: 2036 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.045 s
% 0.21/0.50 # System time : 0.025 s
% 0.21/0.50 # Total time : 0.070 s
% 0.21/0.50 # Maximum resident set size: 1768 pages
% 0.21/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------