TSTP Solution File: KRS087+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KRS087+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:03 EDT 2024
% Result : Unsatisfiable 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 4 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 23 ( 3 avg)
% Number of connectives : 92 ( 37 ~; 33 |; 16 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-3 aty)
% Number of variables : 39 ( 1 sgn 19 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( cp1(X4)
& ? [X5] :
( rr(X4,X5)
& ? [X6] :
( rr(X5,X6)
& ! [X7] :
( rinvR(X6,X7)
=> ~ cp1(X7) )
& cp1(X6) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.8fEeYcZ9GU/E---3.1_20693.p',axiom_2) ).
fof(axiom_6,axiom,
! [X4,X5,X6] :
( ( rr(X4,X5)
& rr(X5,X6) )
=> rr(X4,X6) ),
file('/export/starexec/sandbox/tmp/tmp.8fEeYcZ9GU/E---3.1_20693.p',axiom_6) ).
fof(axiom_5,axiom,
! [X4,X5] :
( rinvR(X4,X5)
<=> rr(X5,X4) ),
file('/export/starexec/sandbox/tmp/tmp.8fEeYcZ9GU/E---3.1_20693.p',axiom_5) ).
fof(axiom_7,axiom,
cUnsatisfiable(i2003_11_14_17_19_46763),
file('/export/starexec/sandbox/tmp/tmp.8fEeYcZ9GU/E---3.1_20693.p',axiom_7) ).
fof(c_0_4,plain,
! [X4] :
( cUnsatisfiable(X4)
<=> ( cp1(X4)
& ? [X5] :
( rr(X4,X5)
& ? [X6] :
( rr(X5,X6)
& ! [X7] :
( rinvR(X6,X7)
=> ~ cp1(X7) )
& cp1(X6) ) ) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_5,plain,
! [X61,X62,X63] :
( ~ rr(X61,X62)
| ~ rr(X62,X63)
| rr(X61,X63) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])])]) ).
fof(c_0_6,plain,
! [X46,X49,X50,X51,X52] :
( ( cp1(X46)
| ~ cUnsatisfiable(X46) )
& ( rr(X46,esk1_1(X46))
| ~ cUnsatisfiable(X46) )
& ( rr(esk1_1(X46),esk2_1(X46))
| ~ cUnsatisfiable(X46) )
& ( ~ rinvR(esk2_1(X46),X49)
| ~ cp1(X49)
| ~ cUnsatisfiable(X46) )
& ( cp1(esk2_1(X46))
| ~ cUnsatisfiable(X46) )
& ( rinvR(X52,esk3_3(X50,X51,X52))
| ~ rr(X51,X52)
| ~ cp1(X52)
| ~ rr(X50,X51)
| ~ cp1(X50)
| cUnsatisfiable(X50) )
& ( cp1(esk3_3(X50,X51,X52))
| ~ rr(X51,X52)
| ~ cp1(X52)
| ~ rr(X50,X51)
| ~ cp1(X50)
| 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)],[c_0_4])])])])])])]) ).
fof(c_0_7,plain,
! [X59,X60] :
( ( ~ rinvR(X59,X60)
| rr(X60,X59) )
& ( ~ rr(X60,X59)
| rinvR(X59,X60) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])]) ).
cnf(c_0_8,plain,
( rr(X1,X3)
| ~ rr(X1,X2)
| ~ rr(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( rr(esk1_1(X1),esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ rinvR(esk2_1(X1),X2)
| ~ cp1(X2)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( rinvR(X2,X1)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( rr(X1,esk2_1(X2))
| ~ rr(X1,esk1_1(X2))
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
( ~ rr(X1,esk2_1(X2))
| ~ cp1(X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( cp1(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,plain,
cUnsatisfiable(i2003_11_14_17_19_46763),
inference(split_conjunct,[status(thm)],[axiom_7]) ).
cnf(c_0_18,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,plain,
$false,
inference(sr,[status(thm)],[c_0_17,c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KRS087+1 : TPTP v8.1.2. Released v3.1.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n011.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Fri May 3 13:42:19 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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.8fEeYcZ9GU/E---3.1_20693.p
% 0.16/0.44 # Version: 3.1.0
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20771 completed with status 0
% 0.16/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: FGHSF-FFSF31-SFFFFFNN
% 0.16/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.44 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.44 # Starting sh5l with 136s (1) cores
% 0.16/0.44 # SAT001_MinMin_p005000_rr_RG with pid 20787 completed with status 0
% 0.16/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: FGHSF-FFSF31-SFFFFFNN
% 0.16/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.16/0.44 # Preprocessing time : 0.001 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Unsatisfiable
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 22
% 0.16/0.44 # Removed by relevancy pruning/SinE : 0
% 0.16/0.44 # Initial clauses : 32
% 0.16/0.44 # Removed in clause preprocessing : 15
% 0.16/0.44 # Initial clauses in saturation : 17
% 0.16/0.44 # Processed clauses : 38
% 0.16/0.44 # ...of these trivial : 0
% 0.16/0.44 # ...subsumed : 0
% 0.16/0.44 # ...remaining for further processing : 38
% 0.16/0.44 # Other redundant clauses eliminated : 0
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 10
% 0.16/0.44 # Backward-rewritten : 0
% 0.16/0.44 # Generated clauses : 12
% 0.16/0.44 # ...of the previous two non-redundant : 8
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 1
% 0.16/0.44 # Paramodulations : 11
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 0
% 0.16/0.44 # Disequality decompositions : 0
% 0.16/0.44 # Total rewrite steps : 0
% 0.16/0.44 # ...of those cached : 0
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 10
% 0.16/0.44 # Positive orientable unit clauses : 0
% 0.16/0.44 # Positive unorientable unit clauses: 0
% 0.16/0.44 # Negative unit clauses : 2
% 0.16/0.44 # Non-unit-clauses : 8
% 0.16/0.44 # Current number of unprocessed clauses: 4
% 0.16/0.44 # ...number of literals in the above : 18
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 29
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 113
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 78
% 0.16/0.44 # Non-unit clause-clause subsumptions : 1
% 0.16/0.44 # Unit Clause-clause subsumption calls : 10
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 0
% 0.16/0.44 # BW rewrite match successes : 0
% 0.16/0.44 # Condensation attempts : 0
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 2260
% 0.16/0.44 # Search garbage collected termcells : 534
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.006 s
% 0.16/0.44 # System time : 0.001 s
% 0.16/0.44 # Total time : 0.007 s
% 0.16/0.44 # Maximum resident set size: 1792 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.018 s
% 0.16/0.44 # System time : 0.005 s
% 0.16/0.44 # Total time : 0.022 s
% 0.16/0.44 # Maximum resident set size: 1716 pages
% 0.16/0.44 % E---3.1 exiting
% 0.16/0.44 % E exiting
%------------------------------------------------------------------------------