TSTP Solution File: KRS179+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KRS179+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:28 EDT 2024
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 4 unt; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 40 ( 14 ~; 16 |; 6 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(isa,axiom,
! [X1,X2] :
( ! [X3,X4] :
( status(X3,X4,X1)
=> status(X3,X4,X2) )
<=> isa(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.te7pa3Cwiw/E---3.1_9953.p',isa) ).
fof(isa_transitive,conjecture,
! [X1,X2,X11] :
( ( isa(X1,X2)
& isa(X2,X11) )
=> isa(X1,X11) ),
file('/export/starexec/sandbox/tmp/tmp.te7pa3Cwiw/E---3.1_9953.p',isa_transitive) ).
fof(c_0_2,plain,
! [X15,X16,X19,X20,X21,X22] :
( ( status(esk4_2(X15,X16),esk5_2(X15,X16),X15)
| isa(X15,X16) )
& ( ~ status(esk4_2(X15,X16),esk5_2(X15,X16),X16)
| isa(X15,X16) )
& ( ~ isa(X19,X20)
| ~ status(X21,X22,X19)
| status(X21,X22,X20) ) ),
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)],[isa])])])])])])]) ).
cnf(c_0_3,plain,
( status(X3,X4,X2)
| ~ isa(X1,X2)
| ~ status(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,plain,
( status(esk4_2(X1,X2),esk5_2(X1,X2),X1)
| isa(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X11] :
( ( isa(X1,X2)
& isa(X2,X11) )
=> isa(X1,X11) ),
inference(assume_negation,[status(cth)],[isa_transitive]) ).
cnf(c_0_6,plain,
( isa(X1,X2)
| status(esk4_2(X1,X2),esk5_2(X1,X2),X3)
| ~ isa(X1,X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
fof(c_0_7,negated_conjecture,
( isa(esk1_0,esk2_0)
& isa(esk2_0,esk3_0)
& ~ isa(esk1_0,esk3_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_8,plain,
( isa(X1,X2)
| status(esk4_2(X1,X2),esk5_2(X1,X2),X3)
| ~ isa(X4,X3)
| ~ isa(X1,X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
isa(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( isa(X1,X2)
| ~ status(esk4_2(X1,X2),esk5_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( isa(X1,X2)
| status(esk4_2(X1,X2),esk5_2(X1,X2),esk3_0)
| ~ isa(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
~ isa(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
( isa(X1,esk3_0)
| ~ isa(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
isa(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : KRS179+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Fri May 3 13:45:54 EDT 2024
% 0.11/0.30 % CPUTime :
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.41 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.te7pa3Cwiw/E---3.1_9953.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 # new_bool_1 with pid 10033 completed with status 0
% 0.16/0.44 # Result found by new_bool_1
% 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.44 # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.16/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.44 # SAT001_MinMin_p005000_rr_RG with pid 10036 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 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.44 # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.16/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (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 Theorem
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 14
% 0.16/0.44 # Removed by relevancy pruning/SinE : 12
% 0.16/0.44 # Initial clauses : 6
% 0.16/0.44 # Removed in clause preprocessing : 0
% 0.16/0.44 # Initial clauses in saturation : 6
% 0.16/0.44 # Processed clauses : 18
% 0.16/0.44 # ...of these trivial : 0
% 0.16/0.44 # ...subsumed : 0
% 0.16/0.44 # ...remaining for further processing : 18
% 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 : 0
% 0.16/0.44 # Backward-rewritten : 0
% 0.16/0.44 # Generated clauses : 13
% 0.16/0.44 # ...of the previous two non-redundant : 10
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 0
% 0.16/0.44 # Paramodulations : 13
% 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 : 1
% 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 : 12
% 0.16/0.44 # Positive orientable unit clauses : 3
% 0.16/0.44 # Positive unorientable unit clauses: 0
% 0.16/0.44 # Negative unit clauses : 1
% 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 : 13
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 6
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 21
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 15
% 0.16/0.44 # Non-unit clause-clause subsumptions : 0
% 0.16/0.44 # Unit Clause-clause subsumption calls : 2
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 5
% 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 : 706
% 0.16/0.44 # Search garbage collected termcells : 223
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.004 s
% 0.16/0.44 # System time : 0.000 s
% 0.16/0.44 # Total time : 0.004 s
% 0.16/0.44 # Maximum resident set size: 1744 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.004 s
% 0.16/0.44 # System time : 0.002 s
% 0.16/0.44 # Total time : 0.006 s
% 0.16/0.44 # Maximum resident set size: 1704 pages
% 0.16/0.44 % E---3.1 exiting
% 0.16/0.44 % E exiting
%------------------------------------------------------------------------------