TSTP Solution File: KRS094+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KRS094+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:04 EDT 2024
% Result : Unsatisfiable 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 5 unt; 0 def)
% Number of atoms : 27 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 25 ( 13 ~; 7 |; 1 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 12 ( 2 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_4,axiom,
! [X1] :
( cc1(X1)
=> ~ cd1(X1) ),
file('/export/starexec/sandbox/tmp/tmp.lQGDXqEhSY/E---3.1_17453.p',axiom_4) ).
fof(axiom_5,axiom,
! [X1] :
( cc1(X1)
=> cd1(X1) ),
file('/export/starexec/sandbox/tmp/tmp.lQGDXqEhSY/E---3.1_17453.p',axiom_5) ).
fof(axiom_2,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> cc1(X1) ),
file('/export/starexec/sandbox/tmp/tmp.lQGDXqEhSY/E---3.1_17453.p',axiom_2) ).
fof(axiom_8,axiom,
cUnsatisfiable(i2003_11_14_17_20_11330),
file('/export/starexec/sandbox/tmp/tmp.lQGDXqEhSY/E---3.1_17453.p',axiom_8) ).
fof(c_0_4,plain,
! [X1] :
( cc1(X1)
=> ~ cd1(X1) ),
inference(fof_simplification,[status(thm)],[axiom_4]) ).
fof(c_0_5,plain,
! [X7] :
( ~ cc1(X7)
| cd1(X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])]) ).
fof(c_0_6,plain,
! [X6] :
( ~ cc1(X6)
| ~ cd1(X6) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
! [X4] :
( ( ~ cUnsatisfiable(X4)
| cc1(X4) )
& ( ~ cc1(X4)
| cUnsatisfiable(X4) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])]) ).
cnf(c_0_8,plain,
( cd1(X1)
| ~ cc1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ cc1(X1)
| ~ cd1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( cc1(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
~ cc1(X1),
inference(csr,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
cUnsatisfiable(i2003_11_14_17_20_11330),
inference(split_conjunct,[status(thm)],[axiom_8]) ).
cnf(c_0_13,plain,
~ cUnsatisfiable(X1),
inference(sr,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
$false,
inference(sr,[status(thm)],[c_0_12,c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : KRS094+1 : TPTP v8.1.2. Released v3.1.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n010.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 13:36:03 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.lQGDXqEhSY/E---3.1_17453.p
% 0.21/0.50 # Version: 3.1.0
% 0.21/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 17534 completed with status 0
% 0.21/0.50 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.21/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.21/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.50 # Starting sh5l with 136s (1) cores
% 0.21/0.50 # SAT001_MinMin_p005000_rr_RG with pid 17544 completed with status 0
% 0.21/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Unsatisfiable
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 9
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 12
% 0.21/0.50 # Removed in clause preprocessing : 1
% 0.21/0.50 # Initial clauses in saturation : 11
% 0.21/0.50 # Processed clauses : 18
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 18
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 2
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 2
% 0.21/0.50 # ...of the previous two non-redundant : 0
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 1
% 0.21/0.50 # Paramodulations : 1
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 0
% 0.21/0.50 # ...of those cached : 0
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 6
% 0.21/0.50 # Positive orientable unit clauses : 0
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 3
% 0.21/0.50 # Non-unit-clauses : 3
% 0.21/0.50 # Current number of unprocessed clauses: 2
% 0.21/0.50 # ...number of literals in the above : 4
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 13
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 11
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 11
% 0.21/0.50 # Non-unit clause-clause subsumptions : 1
% 0.21/0.50 # Unit Clause-clause subsumption calls : 2
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 0
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 540
% 0.21/0.50 # Search garbage collected termcells : 87
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.004 s
% 0.21/0.50 # System time : 0.002 s
% 0.21/0.50 # Total time : 0.006 s
% 0.21/0.50 # Maximum resident set size: 1672 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.009 s
% 0.21/0.50 # System time : 0.009 s
% 0.21/0.50 # Total time : 0.018 s
% 0.21/0.50 # Maximum resident set size: 1692 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------