TSTP Solution File: KRS107+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : KRS107+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 40 ( 4 unt; 0 def)
% Number of atoms : 117 ( 5 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 134 ( 57 ~; 51 |; 18 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 66 ( 2 sgn 33 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_20,axiom,
! [X4,X5] :
( rrx3(X4,X5)
=> rrx(X4,X5) ),
file('/export/starexec/sandbox/tmp/tmp.10FeJokPtz/E---3.1_11348.p',axiom_20) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rrx3(X4,X5)
& cc1(X5) )
& ? [X5] :
( rrx4(X4,X5)
& cc2(X5) )
& ca_Cx1(X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.10FeJokPtz/E---3.1_11348.p',axiom_2) ).
fof(axiom_6,axiom,
! [X4] :
( ca_Cx1xcomp(X4)
<=> ~ ? [X5] : ra_Px1(X4,X5) ),
file('/export/starexec/sandbox/tmp/tmp.10FeJokPtz/E---3.1_11348.p',axiom_6) ).
fof(axiom_4,axiom,
! [X4] :
( ca_Cx1(X4)
<=> ? [X6] : ra_Px1(X4,X6) ),
file('/export/starexec/sandbox/tmp/tmp.10FeJokPtz/E---3.1_11348.p',axiom_4) ).
fof(axiom_7,axiom,
! [X4,X5,X7] :
( ( rrx(X4,X5)
& rrx(X4,X7) )
=> X5 = X7 ),
file('/export/starexec/sandbox/tmp/tmp.10FeJokPtz/E---3.1_11348.p',axiom_7) ).
fof(axiom_17,axiom,
! [X4,X5] :
( rrx4(X4,X5)
=> rrx(X4,X5) ),
file('/export/starexec/sandbox/tmp/tmp.10FeJokPtz/E---3.1_11348.p',axiom_17) ).
fof(axiom_3,axiom,
! [X4] :
( ca_Ax2(X4)
<=> ( cc2(X4)
& cc1(X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.10FeJokPtz/E---3.1_11348.p',axiom_3) ).
fof(axiom_5,axiom,
! [X4] :
( ca_Cx1xcomp(X4)
<=> ? [X5] :
( rrx3(X4,X5)
& ca_Ax2(X5) ) ),
file('/export/starexec/sandbox/tmp/tmp.10FeJokPtz/E---3.1_11348.p',axiom_5) ).
fof(axiom_12,axiom,
cUnsatisfiable(i2003_11_14_17_21_01226),
file('/export/starexec/sandbox/tmp/tmp.10FeJokPtz/E---3.1_11348.p',axiom_12) ).
fof(c_0_9,plain,
! [X144,X145] :
( ~ rrx3(X144,X145)
| rrx(X144,X145) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_20])])]) ).
fof(c_0_10,plain,
! [X96,X99,X100,X101] :
( ( rrx3(X96,esk1_1(X96))
| ~ cUnsatisfiable(X96) )
& ( cc1(esk1_1(X96))
| ~ cUnsatisfiable(X96) )
& ( rrx4(X96,esk2_1(X96))
| ~ cUnsatisfiable(X96) )
& ( cc2(esk2_1(X96))
| ~ cUnsatisfiable(X96) )
& ( ca_Cx1(X96)
| ~ cUnsatisfiable(X96) )
& ( ~ rrx3(X99,X100)
| ~ cc1(X100)
| ~ rrx4(X99,X101)
| ~ cc2(X101)
| ~ ca_Cx1(X99)
| cUnsatisfiable(X99) ) ),
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,
! [X111,X112,X113] :
( ( ~ ca_Cx1xcomp(X111)
| ~ ra_Px1(X111,X112) )
& ( ra_Px1(X113,esk5_1(X113))
| ca_Cx1xcomp(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_6])])])])])]) ).
fof(c_0_12,plain,
! [X103,X105,X106] :
( ( ~ ca_Cx1(X103)
| ra_Px1(X103,esk3_1(X103)) )
& ( ~ ra_Px1(X105,X106)
| ca_Cx1(X105) ) ),
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])])])])])]) ).
fof(c_0_13,plain,
! [X115,X116,X117] :
( ~ rrx(X115,X116)
| ~ rrx(X115,X117)
| X116 = X117 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])])]) ).
cnf(c_0_14,plain,
( rrx(X1,X2)
| ~ rrx3(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( rrx3(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X138,X139] :
( ~ rrx4(X138,X139)
| rrx(X138,X139) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_17])])]) ).
cnf(c_0_17,plain,
( ~ ca_Cx1xcomp(X1)
| ~ ra_Px1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ra_Px1(X1,esk3_1(X1))
| ~ ca_Cx1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_19,plain,
! [X102] :
( ( cc2(X102)
| ~ ca_Ax2(X102) )
& ( cc1(X102)
| ~ ca_Ax2(X102) )
& ( ~ cc2(X102)
| ~ cc1(X102)
| ca_Ax2(X102) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])])]) ).
cnf(c_0_20,plain,
( X2 = X3
| ~ rrx(X1,X2)
| ~ rrx(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( rrx(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,plain,
( rrx(X1,X2)
| ~ rrx4(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( rrx4(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_24,plain,
! [X107,X109,X110] :
( ( rrx3(X107,esk4_1(X107))
| ~ ca_Cx1xcomp(X107) )
& ( ca_Ax2(esk4_1(X107))
| ~ ca_Cx1xcomp(X107) )
& ( ~ rrx3(X109,X110)
| ~ ca_Ax2(X110)
| ca_Cx1xcomp(X109) ) ),
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_5])])])])])])]) ).
cnf(c_0_25,plain,
( ~ ca_Cx1xcomp(X1)
| ~ ca_Cx1(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,plain,
( ca_Cx1(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_27,plain,
( ca_Ax2(X1)
| ~ cc2(X1)
| ~ cc1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,plain,
( cc2(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_29,plain,
( X1 = esk1_1(X2)
| ~ rrx(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,plain,
( rrx(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,plain,
( ca_Cx1xcomp(X1)
| ~ rrx3(X1,X2)
| ~ ca_Ax2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,plain,
( ~ ca_Cx1xcomp(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,plain,
( ca_Ax2(esk2_1(X1))
| ~ cc1(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( esk2_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
( cc1(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_36,plain,
( ~ ca_Ax2(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_15]),c_0_32]) ).
cnf(c_0_37,plain,
cUnsatisfiable(i2003_11_14_17_21_01226),
inference(split_conjunct,[status(thm)],[axiom_12]) ).
cnf(c_0_38,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36]) ).
cnf(c_0_39,plain,
$false,
inference(sr,[status(thm)],[c_0_37,c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : KRS107+1 : TPTP v8.1.2. Released v3.1.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n020.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 13:39:15 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 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.10FeJokPtz/E---3.1_11348.p
% 0.16/0.45 # Version: 3.1.0
% 0.16/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 11426 completed with status 0
% 0.16/0.45 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.16/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.45 # No SInE strategy applied
% 0.16/0.45 # Search class: FGHSF-FFSF11-SFFFFFNN
% 0.16/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/0.45 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.45 # Starting sh5l with 136s (1) cores
% 0.16/0.45 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 11442 completed with status 0
% 0.16/0.45 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.16/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.45 # No SInE strategy applied
% 0.16/0.45 # Search class: FGHSF-FFSF11-SFFFFFNN
% 0.16/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.16/0.45 # Preprocessing time : 0.001 s
% 0.16/0.45 # Presaturation interreduction done
% 0.16/0.45
% 0.16/0.45 # Proof found!
% 0.16/0.45 # SZS status Unsatisfiable
% 0.16/0.45 # SZS output start CNFRefutation
% See solution above
% 0.16/0.45 # Parsed axioms : 53
% 0.16/0.45 # Removed by relevancy pruning/SinE : 0
% 0.16/0.45 # Initial clauses : 66
% 0.16/0.45 # Removed in clause preprocessing : 33
% 0.16/0.45 # Initial clauses in saturation : 33
% 0.16/0.45 # Processed clauses : 94
% 0.16/0.45 # ...of these trivial : 0
% 0.16/0.45 # ...subsumed : 7
% 0.16/0.45 # ...remaining for further processing : 87
% 0.16/0.45 # Other redundant clauses eliminated : 0
% 0.16/0.45 # Clauses deleted for lack of memory : 0
% 0.16/0.45 # Backward-subsumed : 19
% 0.16/0.45 # Backward-rewritten : 0
% 0.16/0.45 # Generated clauses : 45
% 0.16/0.45 # ...of the previous two non-redundant : 35
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 3
% 0.16/0.45 # Paramodulations : 44
% 0.16/0.45 # Factorizations : 0
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 0
% 0.16/0.45 # Disequality decompositions : 0
% 0.16/0.45 # Total rewrite steps : 0
% 0.16/0.45 # ...of those cached : 0
% 0.16/0.45 # Propositional unsat checks : 0
% 0.16/0.45 # Propositional check models : 0
% 0.16/0.45 # Propositional check unsatisfiable : 0
% 0.16/0.45 # Propositional clauses : 0
% 0.16/0.45 # Propositional clauses after purity: 0
% 0.16/0.45 # Propositional unsat core size : 0
% 0.16/0.45 # Propositional preprocessing time : 0.000
% 0.16/0.45 # Propositional encoding time : 0.000
% 0.16/0.45 # Propositional solver time : 0.000
% 0.16/0.45 # Success case prop preproc time : 0.000
% 0.16/0.45 # Success case prop encoding time : 0.000
% 0.16/0.45 # Success case prop solver time : 0.000
% 0.16/0.45 # Current number of processed clauses : 34
% 0.16/0.45 # Positive orientable unit clauses : 0
% 0.16/0.45 # Positive unorientable unit clauses: 0
% 0.16/0.45 # Negative unit clauses : 2
% 0.16/0.45 # Non-unit-clauses : 32
% 0.16/0.45 # Current number of unprocessed clauses: 7
% 0.16/0.45 # ...number of literals in the above : 16
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 54
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 322
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 233
% 0.16/0.45 # Non-unit clause-clause subsumptions : 10
% 0.16/0.45 # Unit Clause-clause subsumption calls : 22
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 0
% 0.16/0.45 # BW rewrite match successes : 0
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 4919
% 0.16/0.45 # Search garbage collected termcells : 1069
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.008 s
% 0.16/0.45 # System time : 0.003 s
% 0.16/0.45 # Total time : 0.010 s
% 0.16/0.45 # Maximum resident set size: 1936 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.025 s
% 0.16/0.45 # System time : 0.008 s
% 0.16/0.45 # Total time : 0.033 s
% 0.16/0.45 # Maximum resident set size: 1752 pages
% 0.16/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------