TSTP Solution File: KRS113+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : KRS113+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:02 EDT 2024
% Result : Unsatisfiable 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 4 unt; 0 def)
% Number of atoms : 118 ( 6 equ)
% Maximal formula atoms : 35 ( 3 avg)
% Number of connectives : 146 ( 61 ~; 58 |; 19 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-1 aty)
% Number of variables : 59 ( 2 sgn 30 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_3,axiom,
! [X4] :
( cp(X4)
<=> ~ ? [X7] : ra_Px1(X4,X7) ),
file('/export/starexec/sandbox2/tmp/tmp.XEC25t2Mji/E---3.1_10092.p',axiom_3) ).
fof(axiom_4,axiom,
! [X4] :
( cpxcomp(X4)
<=> ? [X5] : ra_Px1(X4,X5) ),
file('/export/starexec/sandbox2/tmp/tmp.XEC25t2Mji/E---3.1_10092.p',axiom_4) ).
fof(axiom_8,axiom,
! [X4,X7] :
( rs(X4,X7)
=> rr(X4,X7) ),
file('/export/starexec/sandbox2/tmp/tmp.XEC25t2Mji/E---3.1_10092.p',axiom_8) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ! [X5,X6] :
( ( rr(X4,X5)
& rr(X4,X6) )
=> X5 = X6 )
& ? [X7] :
( rr(X4,X7)
& ca_Vx2(X7) )
& ? [X7] :
( rs(X4,X7)
& cp(X7) )
& cpxcomp(X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XEC25t2Mji/E---3.1_10092.p',axiom_2) ).
fof(axiom_6,axiom,
! [X4,X7] :
( rinvS(X4,X7)
<=> rs(X7,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.XEC25t2Mji/E---3.1_10092.p',axiom_6) ).
fof(axiom_5,axiom,
! [X4] :
( ca_Vx2(X4)
<=> ! [X7] :
( rinvS(X4,X7)
=> cp(X7) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XEC25t2Mji/E---3.1_10092.p',axiom_5) ).
fof(axiom_7,axiom,
cUnsatisfiable(i2003_11_14_17_21_22376),
file('/export/starexec/sandbox2/tmp/tmp.XEC25t2Mji/E---3.1_10092.p',axiom_7) ).
fof(c_0_7,plain,
! [X60,X61,X62] :
( ( ~ cp(X60)
| ~ ra_Px1(X60,X61) )
& ( ra_Px1(X62,esk5_1(X62))
| cp(X62) ) ),
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_3])])])])])]) ).
fof(c_0_8,plain,
! [X64,X66,X67] :
( ( ~ cpxcomp(X64)
| ra_Px1(X64,esk6_1(X64)) )
& ( ~ ra_Px1(X66,X67)
| cpxcomp(X66) ) ),
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_9,plain,
! [X74,X75] :
( ~ rs(X74,X75)
| rr(X74,X75) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_8])])]) ).
fof(c_0_10,plain,
! [X50,X51,X52,X55,X58,X59] :
( ( ~ rr(X50,X51)
| ~ rr(X50,X52)
| X51 = X52
| ~ cUnsatisfiable(X50) )
& ( rr(X50,esk1_1(X50))
| ~ cUnsatisfiable(X50) )
& ( ca_Vx2(esk1_1(X50))
| ~ cUnsatisfiable(X50) )
& ( rs(X50,esk2_1(X50))
| ~ cUnsatisfiable(X50) )
& ( cp(esk2_1(X50))
| ~ cUnsatisfiable(X50) )
& ( cpxcomp(X50)
| ~ cUnsatisfiable(X50) )
& ( rr(X55,esk3_1(X55))
| ~ rr(X55,X58)
| ~ ca_Vx2(X58)
| ~ rs(X55,X59)
| ~ cp(X59)
| ~ cpxcomp(X55)
| cUnsatisfiable(X55) )
& ( rr(X55,esk4_1(X55))
| ~ rr(X55,X58)
| ~ ca_Vx2(X58)
| ~ rs(X55,X59)
| ~ cp(X59)
| ~ cpxcomp(X55)
| cUnsatisfiable(X55) )
& ( esk3_1(X55) != esk4_1(X55)
| ~ rr(X55,X58)
| ~ ca_Vx2(X58)
| ~ rs(X55,X59)
| ~ cp(X59)
| ~ cpxcomp(X55)
| cUnsatisfiable(X55) ) ),
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,
! [X72,X73] :
( ( ~ rinvS(X72,X73)
| rs(X73,X72) )
& ( ~ rs(X73,X72)
| rinvS(X72,X73) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])])]) ).
cnf(c_0_12,plain,
( ~ cp(X1)
| ~ ra_Px1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( ra_Px1(X1,esk6_1(X1))
| ~ cpxcomp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( rr(X1,X2)
| ~ rs(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( rs(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X68,X69,X70] :
( ( ~ ca_Vx2(X68)
| ~ rinvS(X68,X69)
| cp(X69) )
& ( rinvS(X70,esk7_1(X70))
| ca_Vx2(X70) )
& ( ~ cp(esk7_1(X70))
| ca_Vx2(X70) ) ),
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_17,plain,
( rinvS(X2,X1)
| ~ rs(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ~ cpxcomp(X1)
| ~ cp(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( cpxcomp(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,plain,
( X2 = X3
| ~ rr(X1,X2)
| ~ rr(X1,X3)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,plain,
( cp(X2)
| ~ ca_Vx2(X1)
| ~ rinvS(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( rinvS(esk2_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_24,plain,
( ~ cp(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( X1 = esk2_1(X2)
| ~ rr(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_27,plain,
( ~ ca_Vx2(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_28,plain,
( esk2_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( ca_Vx2(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,plain,
cUnsatisfiable(i2003_11_14_17_21_22376),
inference(split_conjunct,[status(thm)],[axiom_7]) ).
cnf(c_0_31,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_32,plain,
$false,
inference(sr,[status(thm)],[c_0_30,c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : KRS113+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n007.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 14:07:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.51 Running first-order model finding
% 0.21/0.51 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.XEC25t2Mji/E---3.1_10092.p
% 0.21/0.53 # Version: 3.1.0
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 10217 completed with status 0
% 0.21/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FGHSF-FFSF11-SFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.53 # Starting sh5l with 136s (1) cores
% 0.21/0.53 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 10236 completed with status 0
% 0.21/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FGHSF-FFSF11-SFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.21/0.53 # Preprocessing time : 0.001 s
% 0.21/0.53 # Presaturation interreduction done
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Unsatisfiable
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 25
% 0.21/0.53 # Removed by relevancy pruning/SinE : 0
% 0.21/0.53 # Initial clauses : 40
% 0.21/0.53 # Removed in clause preprocessing : 17
% 0.21/0.53 # Initial clauses in saturation : 23
% 0.21/0.53 # Processed clauses : 58
% 0.21/0.53 # ...of these trivial : 0
% 0.21/0.53 # ...subsumed : 0
% 0.21/0.53 # ...remaining for further processing : 58
% 0.21/0.53 # Other redundant clauses eliminated : 0
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 14
% 0.21/0.53 # Backward-rewritten : 0
% 0.21/0.53 # Generated clauses : 30
% 0.21/0.53 # ...of the previous two non-redundant : 22
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 2
% 0.21/0.53 # Paramodulations : 29
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 0
% 0.21/0.53 # Disequality decompositions : 0
% 0.21/0.53 # Total rewrite steps : 0
% 0.21/0.53 # ...of those cached : 0
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 20
% 0.21/0.53 # Positive orientable unit clauses : 0
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 2
% 0.21/0.53 # Non-unit-clauses : 18
% 0.21/0.53 # Current number of unprocessed clauses: 10
% 0.21/0.53 # ...number of literals in the above : 31
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 39
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 486
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 205
% 0.21/0.53 # Non-unit clause-clause subsumptions : 2
% 0.21/0.53 # Unit Clause-clause subsumption calls : 14
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 0
% 0.21/0.53 # BW rewrite match successes : 0
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 3053
% 0.21/0.53 # Search garbage collected termcells : 692
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.012 s
% 0.21/0.53 # System time : 0.001 s
% 0.21/0.53 # Total time : 0.013 s
% 0.21/0.53 # Maximum resident set size: 1816 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.028 s
% 0.21/0.53 # System time : 0.007 s
% 0.21/0.53 # Total time : 0.035 s
% 0.21/0.53 # Maximum resident set size: 1716 pages
% 0.21/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------