TSTP Solution File: KRS071+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KRS071+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : Mon May 20 23:16:06 EDT 2024
% Result : Unsatisfiable 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 8 unt; 0 def)
% Number of atoms : 161 ( 27 equ)
% Maximal formula atoms : 67 ( 4 avg)
% Number of connectives : 221 ( 93 ~; 99 |; 25 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-1 aty)
% Number of variables : 38 ( 0 sgn 16 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rr(X4,X5)
& cp1(X5) )
& ? [X5] :
( rr(X4,X5)
& cp2(X5) )
& ? [X5] :
( rr(X4,X5)
& cp3(X5) )
& ! [X6,X7,X8] :
( ( rr(X4,X6)
& rr(X4,X7)
& rr(X4,X8) )
=> ( X6 = X7
| X6 = X8
| X7 = X8 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_8,axiom,
cUnsatisfiable(i2003_11_14_17_18_39380),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
fof(axiom_4,axiom,
! [X4] :
( cp2(X4)
=> ~ ( cp4(X4)
| cp3(X4)
| cp5(X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_3,axiom,
! [X4] :
( cp1(X4)
=> ~ ( cp4(X4)
| cp2(X4)
| cp3(X4)
| cp5(X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(c_0_4,plain,
! [X43,X47,X48,X49,X50,X51,X52,X53] :
( ( rr(X43,esk1_1(X43))
| ~ cUnsatisfiable(X43) )
& ( cp1(esk1_1(X43))
| ~ cUnsatisfiable(X43) )
& ( rr(X43,esk2_1(X43))
| ~ cUnsatisfiable(X43) )
& ( cp2(esk2_1(X43))
| ~ cUnsatisfiable(X43) )
& ( rr(X43,esk3_1(X43))
| ~ cUnsatisfiable(X43) )
& ( cp3(esk3_1(X43))
| ~ cUnsatisfiable(X43) )
& ( ~ rr(X43,X47)
| ~ rr(X43,X48)
| ~ rr(X43,X49)
| X47 = X48
| X47 = X49
| X48 = X49
| ~ cUnsatisfiable(X43) )
& ( rr(X50,esk4_1(X50))
| ~ rr(X50,X51)
| ~ cp1(X51)
| ~ rr(X50,X52)
| ~ cp2(X52)
| ~ rr(X50,X53)
| ~ cp3(X53)
| cUnsatisfiable(X50) )
& ( rr(X50,esk5_1(X50))
| ~ rr(X50,X51)
| ~ cp1(X51)
| ~ rr(X50,X52)
| ~ cp2(X52)
| ~ rr(X50,X53)
| ~ cp3(X53)
| cUnsatisfiable(X50) )
& ( rr(X50,esk6_1(X50))
| ~ rr(X50,X51)
| ~ cp1(X51)
| ~ rr(X50,X52)
| ~ cp2(X52)
| ~ rr(X50,X53)
| ~ cp3(X53)
| cUnsatisfiable(X50) )
& ( esk4_1(X50) != esk5_1(X50)
| ~ rr(X50,X51)
| ~ cp1(X51)
| ~ rr(X50,X52)
| ~ cp2(X52)
| ~ rr(X50,X53)
| ~ cp3(X53)
| cUnsatisfiable(X50) )
& ( esk4_1(X50) != esk6_1(X50)
| ~ rr(X50,X51)
| ~ cp1(X51)
| ~ rr(X50,X52)
| ~ cp2(X52)
| ~ rr(X50,X53)
| ~ cp3(X53)
| cUnsatisfiable(X50) )
& ( esk5_1(X50) != esk6_1(X50)
| ~ rr(X50,X51)
| ~ cp1(X51)
| ~ rr(X50,X52)
| ~ cp2(X52)
| ~ rr(X50,X53)
| ~ cp3(X53)
| cUnsatisfiable(X50) ) ),
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_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_18_39380),
inference(split_conjunct,[status(thm)],[axiom_8]) ).
cnf(c_0_7,plain,
( X2 = X3
| X2 = X4
| X3 = X4
| ~ rr(X1,X2)
| ~ rr(X1,X3)
| ~ rr(X1,X4)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
rr(i2003_11_14_17_18_39380,esk1_1(i2003_11_14_17_18_39380)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
( rr(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_10,plain,
! [X58] :
( ( ~ cp4(X58)
| ~ cp2(X58) )
& ( ~ cp3(X58)
| ~ cp2(X58) )
& ( ~ cp5(X58)
| ~ cp2(X58) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])])]) ).
cnf(c_0_11,plain,
( X1 = esk1_1(i2003_11_14_17_18_39380)
| X2 = esk1_1(i2003_11_14_17_18_39380)
| X1 = X2
| ~ rr(i2003_11_14_17_18_39380,X2)
| ~ rr(i2003_11_14_17_18_39380,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,
rr(i2003_11_14_17_18_39380,esk3_1(i2003_11_14_17_18_39380)),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_13,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,plain,
( ~ cp3(X1)
| ~ cp2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( cp3(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,plain,
( esk3_1(i2003_11_14_17_18_39380) = esk1_1(i2003_11_14_17_18_39380)
| X1 = esk3_1(i2003_11_14_17_18_39380)
| X1 = esk1_1(i2003_11_14_17_18_39380)
| ~ rr(i2003_11_14_17_18_39380,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
rr(i2003_11_14_17_18_39380,esk2_1(i2003_11_14_17_18_39380)),
inference(spm,[status(thm)],[c_0_13,c_0_6]) ).
fof(c_0_18,plain,
! [X57] :
( ( ~ cp4(X57)
| ~ cp1(X57) )
& ( ~ cp2(X57)
| ~ cp1(X57) )
& ( ~ cp3(X57)
| ~ cp1(X57) )
& ( ~ cp5(X57)
| ~ cp1(X57) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])])]) ).
cnf(c_0_19,plain,
( ~ cp2(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( esk2_1(i2003_11_14_17_18_39380) = esk1_1(i2003_11_14_17_18_39380)
| esk3_1(i2003_11_14_17_18_39380) = esk2_1(i2003_11_14_17_18_39380)
| esk3_1(i2003_11_14_17_18_39380) = esk1_1(i2003_11_14_17_18_39380) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( ~ cp3(X1)
| ~ cp1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
( esk3_1(i2003_11_14_17_18_39380) = esk1_1(i2003_11_14_17_18_39380)
| esk2_1(i2003_11_14_17_18_39380) = esk1_1(i2003_11_14_17_18_39380)
| ~ cp2(esk2_1(i2003_11_14_17_18_39380)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_6])]) ).
cnf(c_0_23,plain,
( cp2(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_24,plain,
( ~ cp1(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_15]) ).
cnf(c_0_25,plain,
( esk2_1(i2003_11_14_17_18_39380) = esk1_1(i2003_11_14_17_18_39380)
| esk3_1(i2003_11_14_17_18_39380) = esk1_1(i2003_11_14_17_18_39380) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_6])]) ).
cnf(c_0_26,plain,
( ~ cp2(X1)
| ~ cp1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
( esk2_1(i2003_11_14_17_18_39380) = esk1_1(i2003_11_14_17_18_39380)
| ~ cp1(esk1_1(i2003_11_14_17_18_39380)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_6])]) ).
cnf(c_0_28,plain,
( cp1(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_29,plain,
( ~ cp1(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_30,plain,
esk2_1(i2003_11_14_17_18_39380) = esk1_1(i2003_11_14_17_18_39380),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_6])]) ).
cnf(c_0_31,plain,
~ cp1(esk1_1(i2003_11_14_17_18_39380)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_6])]) ).
cnf(c_0_32,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_28]),c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.13 % Problem : KRS071+1 : TPTP v8.2.0. Released v3.1.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 22:14:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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/benchmark/theBenchmark.p
% 0.21/0.51 # Version: 3.1.0
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 31438 completed with status 0
% 0.21/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FGHSF-FFMF11-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 811s (1) cores
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.51 # Starting sh5l with 136s (1) cores
% 0.21/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 31454 completed with status 0
% 0.21/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FGHSF-FFMF11-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 811s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Unsatisfiable
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 23
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 44
% 0.21/0.51 # Removed in clause preprocessing : 15
% 0.21/0.51 # Initial clauses in saturation : 29
% 0.21/0.51 # Processed clauses : 79
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 0
% 0.21/0.51 # ...remaining for further processing : 79
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 4
% 0.21/0.51 # Backward-rewritten : 5
% 0.21/0.51 # Generated clauses : 49
% 0.21/0.51 # ...of the previous two non-redundant : 31
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 48
% 0.21/0.51 # Factorizations : 1
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 38
% 0.21/0.51 # ...of those cached : 31
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 41
% 0.21/0.51 # Positive orientable unit clauses : 7
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 2
% 0.21/0.51 # Non-unit-clauses : 32
% 0.21/0.51 # Current number of unprocessed clauses: 10
% 0.21/0.51 # ...number of literals in the above : 33
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 39
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 862
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 345
% 0.21/0.51 # Non-unit clause-clause subsumptions : 4
% 0.21/0.51 # Unit Clause-clause subsumption calls : 32
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 1
% 0.21/0.51 # BW rewrite match successes : 1
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 3666
% 0.21/0.51 # Search garbage collected termcells : 648
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.006 s
% 0.21/0.51 # System time : 0.003 s
% 0.21/0.51 # Total time : 0.009 s
% 0.21/0.51 # Maximum resident set size: 1820 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.023 s
% 0.21/0.51 # System time : 0.004 s
% 0.21/0.51 # Total time : 0.027 s
% 0.21/0.51 # Maximum resident set size: 1716 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------