TSTP Solution File: KRS110+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KRS110+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:07 EDT 2024
% Result : Unsatisfiable 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 4 unt; 0 def)
% Number of atoms : 69 ( 0 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 82 ( 34 ~; 30 |; 13 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 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 : 34 ( 2 sgn 18 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_3,axiom,
! [X4] :
( cp(X4)
<=> ~ ? [X5] : ra_Px1(X4,X5) ),
file('/export/starexec/sandbox2/tmp/tmp.LZxeQrooO7/E---3.1_9726.p',axiom_3) ).
fof(axiom_4,axiom,
! [X4] :
( cpxcomp(X4)
<=> ? [X6] : ra_Px1(X4,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.LZxeQrooO7/E---3.1_9726.p',axiom_4) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rs(X4,X5)
& ca_Ax2(X5) )
& ! [X5] :
( rs(X4,X5)
=> cpxcomp(X5) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.LZxeQrooO7/E---3.1_9726.p',axiom_2) ).
fof(axiom_5,axiom,
! [X4] :
( ca_Ax2(X4)
<=> ( cp(X4)
& ? [X5] :
( rinvS(X4,X5)
& cp(X5) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.LZxeQrooO7/E---3.1_9726.p',axiom_5) ).
fof(axiom_12,axiom,
cUnsatisfiable(i2003_11_14_17_21_12565),
file('/export/starexec/sandbox2/tmp/tmp.LZxeQrooO7/E---3.1_9726.p',axiom_12) ).
fof(c_0_5,plain,
! [X74,X75,X76] :
( ( ~ cp(X74)
| ~ ra_Px1(X74,X75) )
& ( ra_Px1(X76,esk3_1(X76))
| cp(X76) ) ),
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_6,plain,
! [X78,X80,X81] :
( ( ~ cpxcomp(X78)
| ra_Px1(X78,esk4_1(X78)) )
& ( ~ ra_Px1(X80,X81)
| cpxcomp(X80) ) ),
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_7,plain,
! [X68,X70,X71,X72] :
( ( rs(X68,esk1_1(X68))
| ~ cUnsatisfiable(X68) )
& ( ca_Ax2(esk1_1(X68))
| ~ cUnsatisfiable(X68) )
& ( ~ rs(X68,X70)
| cpxcomp(X70)
| ~ cUnsatisfiable(X68) )
& ( rs(X71,esk2_1(X71))
| ~ rs(X71,X72)
| ~ ca_Ax2(X72)
| cUnsatisfiable(X71) )
& ( ~ cpxcomp(esk2_1(X71))
| ~ rs(X71,X72)
| ~ ca_Ax2(X72)
| cUnsatisfiable(X71) ) ),
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,
( ~ cp(X1)
| ~ ra_Px1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ra_Px1(X1,esk4_1(X1))
| ~ cpxcomp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( cpxcomp(X2)
| ~ rs(X1,X2)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( rs(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ~ cpxcomp(X1)
| ~ cp(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( cpxcomp(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_14,plain,
! [X82,X84,X85] :
( ( cp(X82)
| ~ ca_Ax2(X82) )
& ( rinvS(X82,esk5_1(X82))
| ~ ca_Ax2(X82) )
& ( cp(esk5_1(X82))
| ~ ca_Ax2(X82) )
& ( ~ cp(X84)
| ~ rinvS(X84,X85)
| ~ cp(X85)
| ca_Ax2(X84) ) ),
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_15,plain,
( ~ cp(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( cp(X1)
| ~ ca_Ax2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,plain,
( ca_Ax2(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,plain,
cUnsatisfiable(i2003_11_14_17_21_12565),
inference(split_conjunct,[status(thm)],[axiom_12]) ).
cnf(c_0_19,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[c_0_18,c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KRS110+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n019.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:40:29 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.LZxeQrooO7/E---3.1_9726.p
% 0.20/0.51 # Version: 3.1.0
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 9804 completed with status 0
% 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGHSF-FFSF11-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.51 # Starting sh5l with 136s (1) cores
% 0.20/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 9820 completed with status 0
% 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGHSF-FFSF11-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Unsatisfiable
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 37
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 51
% 0.20/0.51 # Removed in clause preprocessing : 23
% 0.20/0.51 # Initial clauses in saturation : 28
% 0.20/0.51 # Processed clauses : 59
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 0
% 0.20/0.51 # ...remaining for further processing : 59
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 5
% 0.20/0.51 # Backward-rewritten : 0
% 0.20/0.51 # Generated clauses : 16
% 0.20/0.51 # ...of the previous two non-redundant : 10
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 1
% 0.20/0.51 # Paramodulations : 15
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 0
% 0.20/0.51 # ...of those cached : 0
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 25
% 0.20/0.51 # Positive orientable unit clauses : 0
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 2
% 0.20/0.51 # Non-unit-clauses : 23
% 0.20/0.51 # Current number of unprocessed clauses: 7
% 0.20/0.51 # ...number of literals in the above : 19
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 35
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 358
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 245
% 0.20/0.51 # Non-unit clause-clause subsumptions : 1
% 0.20/0.51 # Unit Clause-clause subsumption calls : 5
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 0
% 0.20/0.51 # BW rewrite match successes : 0
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 3463
% 0.20/0.51 # Search garbage collected termcells : 828
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.010 s
% 0.20/0.51 # System time : 0.001 s
% 0.20/0.51 # Total time : 0.011 s
% 0.20/0.51 # Maximum resident set size: 1896 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.027 s
% 0.20/0.51 # System time : 0.005 s
% 0.20/0.51 # Total time : 0.032 s
% 0.20/0.51 # Maximum resident set size: 1752 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------