TSTP Solution File: KRS125+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KRS125+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:09 EDT 2024
% Result : Unsatisfiable 0.22s 0.52s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 4 unt; 0 def)
% Number of atoms : 60 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 60 ( 27 ~; 22 |; 5 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 31 ( 2 sgn 16 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_6,axiom,
! [X1] :
( cd(X1)
<=> ~ ? [X2] : ra_Px1(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.KacwgACmJi/E---3.1_16990.p',axiom_6) ).
fof(axiom_7,axiom,
! [X1] :
( cdxcomp(X1)
<=> ? [X3] : ra_Px1(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.KacwgACmJi/E---3.1_16990.p',axiom_7) ).
fof(axiom_3,axiom,
! [X1] :
( cc(X1)
=> cdxcomp(X1) ),
file('/export/starexec/sandbox/tmp/tmp.KacwgACmJi/E---3.1_16990.p',axiom_3) ).
fof(axiom_10,axiom,
! [X1] :
( ce3(X1)
=> cc(X1) ),
file('/export/starexec/sandbox/tmp/tmp.KacwgACmJi/E---3.1_16990.p',axiom_10) ).
fof(axiom_11,axiom,
! [X1] :
( cf(X1)
=> cd(X1) ),
file('/export/starexec/sandbox/tmp/tmp.KacwgACmJi/E---3.1_16990.p',axiom_11) ).
fof(axiom_2,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ce3(X1)
& cf(X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.KacwgACmJi/E---3.1_16990.p',axiom_2) ).
fof(axiom_12,axiom,
cUnsatisfiable(i2003_11_14_17_22_17947),
file('/export/starexec/sandbox/tmp/tmp.KacwgACmJi/E---3.1_16990.p',axiom_12) ).
fof(c_0_7,plain,
! [X10,X11,X12] :
( ( ~ cd(X10)
| ~ ra_Px1(X10,X11) )
& ( ra_Px1(X12,esk1_1(X12))
| cd(X12) ) ),
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_8,plain,
! [X14,X16,X17] :
( ( ~ cdxcomp(X14)
| ra_Px1(X14,esk2_1(X14)) )
& ( ~ ra_Px1(X16,X17)
| cdxcomp(X16) ) ),
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_7])])])])])]) ).
fof(c_0_9,plain,
! [X7] :
( ~ cc(X7)
| cdxcomp(X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])]) ).
fof(c_0_10,plain,
! [X26] :
( ~ ce3(X26)
| cc(X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_10])])]) ).
cnf(c_0_11,plain,
( ~ cd(X1)
| ~ ra_Px1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ra_Px1(X1,esk2_1(X1))
| ~ cdxcomp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( cdxcomp(X1)
| ~ cc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( cc(X1)
| ~ ce3(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X27] :
( ~ cf(X27)
| cd(X27) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_11])])]) ).
fof(c_0_16,plain,
! [X6] :
( ( ce3(X6)
| ~ cUnsatisfiable(X6) )
& ( cf(X6)
| ~ cUnsatisfiable(X6) )
& ( ~ ce3(X6)
| ~ cf(X6)
| cUnsatisfiable(X6) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])])]) ).
cnf(c_0_17,plain,
( ~ cd(X1)
| ~ cdxcomp(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
( cdxcomp(X1)
| ~ ce3(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
( cd(X1)
| ~ cf(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( cf(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( ~ cd(X1)
| ~ ce3(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( ce3(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( cd(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
cUnsatisfiable(i2003_11_14_17_22_17947),
inference(split_conjunct,[status(thm)],[axiom_12]) ).
cnf(c_0_25,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[c_0_24,c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : KRS125+1 : TPTP v8.1.2. Released v3.1.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n019.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 13:53:59 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/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/tmp/tmp.KacwgACmJi/E---3.1_16990.p
% 0.22/0.52 # Version: 3.1.0
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 17079 completed with status 0
% 0.22/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # No SInE strategy applied
% 0.22/0.52 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.22/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.52 # Starting sh5l with 136s (1) cores
% 0.22/0.52 # SAT001_MinMin_p005000_rr_RG with pid 17089 completed with status 0
% 0.22/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # No SInE strategy applied
% 0.22/0.52 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.22/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.52 # Preprocessing time : 0.002 s
% 0.22/0.52 # Presaturation interreduction done
% 0.22/0.52
% 0.22/0.52 # Proof found!
% 0.22/0.52 # SZS status Unsatisfiable
% 0.22/0.52 # SZS output start CNFRefutation
% See solution above
% 0.22/0.52 # Parsed axioms : 13
% 0.22/0.52 # Removed by relevancy pruning/SinE : 0
% 0.22/0.52 # Initial clauses : 21
% 0.22/0.52 # Removed in clause preprocessing : 1
% 0.22/0.52 # Initial clauses in saturation : 20
% 0.22/0.52 # Processed clauses : 44
% 0.22/0.52 # ...of these trivial : 0
% 0.22/0.52 # ...subsumed : 0
% 0.22/0.52 # ...remaining for further processing : 44
% 0.22/0.52 # Other redundant clauses eliminated : 0
% 0.22/0.52 # Clauses deleted for lack of memory : 0
% 0.22/0.52 # Backward-subsumed : 3
% 0.22/0.52 # Backward-rewritten : 0
% 0.22/0.52 # Generated clauses : 11
% 0.22/0.52 # ...of the previous two non-redundant : 6
% 0.22/0.52 # ...aggressively subsumed : 0
% 0.22/0.52 # Contextual simplify-reflections : 1
% 0.22/0.52 # Paramodulations : 10
% 0.22/0.52 # Factorizations : 0
% 0.22/0.52 # NegExts : 0
% 0.22/0.52 # Equation resolutions : 0
% 0.22/0.52 # Disequality decompositions : 0
% 0.22/0.52 # Total rewrite steps : 0
% 0.22/0.52 # ...of those cached : 0
% 0.22/0.52 # Propositional unsat checks : 0
% 0.22/0.52 # Propositional check models : 0
% 0.22/0.52 # Propositional check unsatisfiable : 0
% 0.22/0.52 # Propositional clauses : 0
% 0.22/0.52 # Propositional clauses after purity: 0
% 0.22/0.52 # Propositional unsat core size : 0
% 0.22/0.52 # Propositional preprocessing time : 0.000
% 0.22/0.52 # Propositional encoding time : 0.000
% 0.22/0.52 # Propositional solver time : 0.000
% 0.22/0.52 # Success case prop preproc time : 0.000
% 0.22/0.52 # Success case prop encoding time : 0.000
% 0.22/0.52 # Success case prop solver time : 0.000
% 0.22/0.52 # Current number of processed clauses : 20
% 0.22/0.52 # Positive orientable unit clauses : 0
% 0.22/0.52 # Positive unorientable unit clauses: 0
% 0.22/0.52 # Negative unit clauses : 2
% 0.22/0.52 # Non-unit-clauses : 18
% 0.22/0.52 # Current number of unprocessed clauses: 2
% 0.22/0.52 # ...number of literals in the above : 4
% 0.22/0.52 # Current number of archived formulas : 0
% 0.22/0.52 # Current number of archived clauses : 25
% 0.22/0.52 # Clause-clause subsumption calls (NU) : 71
% 0.22/0.52 # Rec. Clause-clause subsumption calls : 67
% 0.22/0.52 # Non-unit clause-clause subsumptions : 1
% 0.22/0.52 # Unit Clause-clause subsumption calls : 3
% 0.22/0.52 # Rewrite failures with RHS unbound : 0
% 0.22/0.52 # BW rewrite match attempts : 0
% 0.22/0.52 # BW rewrite match successes : 0
% 0.22/0.52 # Condensation attempts : 0
% 0.22/0.52 # Condensation successes : 0
% 0.22/0.52 # Termbank termtop insertions : 1230
% 0.22/0.52 # Search garbage collected termcells : 252
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.008 s
% 0.22/0.52 # System time : 0.002 s
% 0.22/0.52 # Total time : 0.011 s
% 0.22/0.52 # Maximum resident set size: 1700 pages
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.027 s
% 0.22/0.52 # System time : 0.007 s
% 0.22/0.52 # Total time : 0.035 s
% 0.22/0.52 # Maximum resident set size: 1700 pages
% 0.22/0.52 % E---3.1 exiting
% 0.22/0.52 % E exiting
%------------------------------------------------------------------------------