TSTP Solution File: KRS101+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KRS101+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:12:05 EDT 2024
% Result : Unsatisfiable 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 8 unt; 0 def)
% Number of atoms : 153 ( 24 equ)
% Maximal formula atoms : 87 ( 6 avg)
% Number of connectives : 205 ( 76 ~; 92 |; 27 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-1 aty)
% Number of variables : 42 ( 0 sgn 22 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ! [X5] :
( rr(X4,X5)
=> cd(X5) )
& ! [X5] :
( rr(X4,X5)
=> ( ~ ? [X6,X7] :
( rs(X5,X6)
& rs(X5,X7)
& X6 != X7 )
| cc(X5) ) )
& ? [X5] :
( rr(X4,X5)
& ~ ! [X6,X7] :
( ( rs(X5,X6)
& rs(X5,X7) )
=> X6 = X7 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.1absB218cC/E---3.1_7598.p',axiom_2) ).
fof(axiom_4,axiom,
cUnsatisfiable(i2003_11_14_17_20_36582),
file('/export/starexec/sandbox/tmp/tmp.1absB218cC/E---3.1_7598.p',axiom_4) ).
fof(axiom_3,axiom,
! [X4] :
( cc(X4)
=> ~ cd(X4) ),
file('/export/starexec/sandbox/tmp/tmp.1absB218cC/E---3.1_7598.p',axiom_3) ).
fof(c_0_3,plain,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ! [X5] :
( rr(X4,X5)
=> cd(X5) )
& ! [X5] :
( rr(X4,X5)
=> ( ~ ? [X6,X7] :
( rs(X5,X6)
& rs(X5,X7)
& X6 != X7 )
| cc(X5) ) )
& ? [X5] :
( rr(X4,X5)
& ~ ! [X6,X7] :
( ( rs(X5,X6)
& rs(X5,X7) )
=> X6 = X7 ) ) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_4,plain,
! [X36,X37,X38,X39,X40,X44,X49,X50,X51] :
( ( ~ rr(X36,X37)
| cd(X37)
| ~ cUnsatisfiable(X36) )
& ( ~ rr(X36,X38)
| ~ rs(X38,X39)
| ~ rs(X38,X40)
| X39 = X40
| cc(X38)
| ~ cUnsatisfiable(X36) )
& ( rr(X36,esk1_1(X36))
| ~ cUnsatisfiable(X36) )
& ( rs(esk1_1(X36),esk2_1(X36))
| ~ cUnsatisfiable(X36) )
& ( rs(esk1_1(X36),esk3_1(X36))
| ~ cUnsatisfiable(X36) )
& ( esk2_1(X36) != esk3_1(X36)
| ~ cUnsatisfiable(X36) )
& ( rr(X44,esk5_1(X44))
| rr(X44,esk4_1(X44))
| ~ rr(X44,X49)
| ~ rs(X49,X50)
| ~ rs(X49,X51)
| X50 = X51
| cUnsatisfiable(X44) )
& ( rs(esk5_1(X44),esk6_1(X44))
| rr(X44,esk4_1(X44))
| ~ rr(X44,X49)
| ~ rs(X49,X50)
| ~ rs(X49,X51)
| X50 = X51
| cUnsatisfiable(X44) )
& ( rs(esk5_1(X44),esk7_1(X44))
| rr(X44,esk4_1(X44))
| ~ rr(X44,X49)
| ~ rs(X49,X50)
| ~ rs(X49,X51)
| X50 = X51
| cUnsatisfiable(X44) )
& ( esk6_1(X44) != esk7_1(X44)
| rr(X44,esk4_1(X44))
| ~ rr(X44,X49)
| ~ rs(X49,X50)
| ~ rs(X49,X51)
| X50 = X51
| cUnsatisfiable(X44) )
& ( ~ cc(esk5_1(X44))
| rr(X44,esk4_1(X44))
| ~ rr(X44,X49)
| ~ rs(X49,X50)
| ~ rs(X49,X51)
| X50 = X51
| cUnsatisfiable(X44) )
& ( rr(X44,esk5_1(X44))
| ~ cd(esk4_1(X44))
| ~ rr(X44,X49)
| ~ rs(X49,X50)
| ~ rs(X49,X51)
| X50 = X51
| cUnsatisfiable(X44) )
& ( rs(esk5_1(X44),esk6_1(X44))
| ~ cd(esk4_1(X44))
| ~ rr(X44,X49)
| ~ rs(X49,X50)
| ~ rs(X49,X51)
| X50 = X51
| cUnsatisfiable(X44) )
& ( rs(esk5_1(X44),esk7_1(X44))
| ~ cd(esk4_1(X44))
| ~ rr(X44,X49)
| ~ rs(X49,X50)
| ~ rs(X49,X51)
| X50 = X51
| cUnsatisfiable(X44) )
& ( esk6_1(X44) != esk7_1(X44)
| ~ cd(esk4_1(X44))
| ~ rr(X44,X49)
| ~ rs(X49,X50)
| ~ rs(X49,X51)
| X50 = X51
| cUnsatisfiable(X44) )
& ( ~ cc(esk5_1(X44))
| ~ cd(esk4_1(X44))
| ~ rr(X44,X49)
| ~ rs(X49,X50)
| ~ rs(X49,X51)
| X50 = X51
| cUnsatisfiable(X44) ) ),
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)],[c_0_3])])])])])])]) ).
cnf(c_0_5,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,plain,
cUnsatisfiable(i2003_11_14_17_20_36582),
inference(split_conjunct,[status(thm)],[axiom_4]) ).
cnf(c_0_7,plain,
( X3 = X4
| cc(X2)
| ~ rr(X1,X2)
| ~ rs(X2,X3)
| ~ rs(X2,X4)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
rr(i2003_11_14_17_20_36582,esk1_1(i2003_11_14_17_20_36582)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
( rs(esk1_1(X1),esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_10,plain,
! [X4] :
( cc(X4)
=> ~ cd(X4) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
cnf(c_0_11,plain,
( X1 = X2
| cc(esk1_1(i2003_11_14_17_20_36582))
| ~ rs(esk1_1(i2003_11_14_17_20_36582),X2)
| ~ rs(esk1_1(i2003_11_14_17_20_36582),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_6])]) ).
cnf(c_0_12,plain,
rs(esk1_1(i2003_11_14_17_20_36582),esk3_1(i2003_11_14_17_20_36582)),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_13,plain,
( rs(esk1_1(X1),esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_14,plain,
! [X52] :
( ~ cc(X52)
| ~ cd(X52) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_15,plain,
( X1 = esk3_1(i2003_11_14_17_20_36582)
| cc(esk1_1(i2003_11_14_17_20_36582))
| ~ rs(esk1_1(i2003_11_14_17_20_36582),X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
rs(esk1_1(i2003_11_14_17_20_36582),esk2_1(i2003_11_14_17_20_36582)),
inference(spm,[status(thm)],[c_0_13,c_0_6]) ).
cnf(c_0_17,plain,
( cd(X2)
| ~ rr(X1,X2)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_18,plain,
( ~ cc(X1)
| ~ cd(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( esk3_1(i2003_11_14_17_20_36582) = esk2_1(i2003_11_14_17_20_36582)
| cc(esk1_1(i2003_11_14_17_20_36582)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
cd(esk1_1(i2003_11_14_17_20_36582)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_8]),c_0_6])]) ).
cnf(c_0_21,plain,
( esk2_1(X1) != esk3_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_22,plain,
esk3_1(i2003_11_14_17_20_36582) = esk2_1(i2003_11_14_17_20_36582),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_23,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS101+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Fri May 3 13:40:35 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.1absB218cC/E---3.1_7598.p
% 0.19/0.49 # Version: 3.1.0
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 7676 completed with status 0
% 0.19/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # No SInE strategy applied
% 0.19/0.49 # Search class: FGHSF-FFMF11-SFFFFFNN
% 0.19/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 811s (1) cores
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.49 # Starting sh5l with 136s (1) cores
% 0.19/0.49 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 7689 completed with status 0
% 0.19/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # No SInE strategy applied
% 0.19/0.49 # Search class: FGHSF-FFMF11-SFFFFFNN
% 0.19/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 811s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Unsatisfiable
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 16
% 0.19/0.49 # Removed by relevancy pruning/SinE : 0
% 0.19/0.49 # Initial clauses : 33
% 0.19/0.49 # Removed in clause preprocessing : 12
% 0.19/0.49 # Initial clauses in saturation : 21
% 0.19/0.49 # Processed clauses : 47
% 0.19/0.49 # ...of these trivial : 0
% 0.19/0.49 # ...subsumed : 0
% 0.19/0.49 # ...remaining for further processing : 47
% 0.19/0.49 # Other redundant clauses eliminated : 0
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 0
% 0.19/0.49 # Backward-rewritten : 3
% 0.19/0.49 # Generated clauses : 16
% 0.19/0.49 # ...of the previous two non-redundant : 10
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 0
% 0.19/0.49 # Paramodulations : 16
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 0
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 13
% 0.19/0.49 # ...of those cached : 9
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 23
% 0.19/0.49 # Positive orientable unit clauses : 5
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 1
% 0.19/0.49 # Non-unit-clauses : 17
% 0.19/0.49 # Current number of unprocessed clauses: 4
% 0.19/0.49 # ...number of literals in the above : 24
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 25
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 409
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 49
% 0.19/0.49 # Non-unit clause-clause subsumptions : 0
% 0.19/0.49 # Unit Clause-clause subsumption calls : 22
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 1
% 0.19/0.49 # BW rewrite match successes : 1
% 0.19/0.49 # Condensation attempts : 0
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 2793
% 0.19/0.49 # Search garbage collected termcells : 550
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.007 s
% 0.19/0.49 # System time : 0.001 s
% 0.19/0.49 # Total time : 0.008 s
% 0.19/0.49 # Maximum resident set size: 1804 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.022 s
% 0.19/0.49 # System time : 0.005 s
% 0.19/0.49 # Total time : 0.027 s
% 0.19/0.49 # Maximum resident set size: 1708 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.49 % E exiting
%------------------------------------------------------------------------------