TSTP Solution File: KRS190+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KRS190+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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 : 600s
% DateTime : Sun Jul 17 03:00:04 EDT 2022
% Result : Theorem 0.22s 1.42s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 5 unt; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 46 ( 16 ~; 18 |; 7 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 40 ( 11 sgn 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(tau,axiom,
! [X1,X2] :
( ! [X3] :
( model(X3,X1)
& model(X3,X2) )
<=> status(X1,X2,tau) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',tau) ).
fof(isa,axiom,
! [X7,X8] :
( ! [X1,X2] :
( status(X1,X2,X7)
=> status(X1,X2,X8) )
<=> isa(X7,X8) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',isa) ).
fof(thm,axiom,
! [X1,X2] :
( ! [X3] :
( model(X3,X1)
=> model(X3,X2) )
<=> status(X1,X2,thm) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',thm) ).
fof(isa_tau_thm,conjecture,
isa(tau,thm),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',isa_tau_thm) ).
fof(c_0_4,plain,
! [X4,X5,X4,X5,X7,X7] :
( ( ~ model(esk4_2(X4,X5),X4)
| ~ model(esk5_2(X4,X5),X5)
| status(X4,X5,tau) )
& ( model(X7,X4)
| ~ status(X4,X5,tau) )
& ( model(X7,X5)
| ~ status(X4,X5,tau) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[tau])])])])])])]) ).
fof(c_0_5,plain,
! [X9,X10,X9,X10,X13,X14] :
( ( status(esk1_2(X9,X10),esk2_2(X9,X10),X9)
| isa(X9,X10) )
& ( ~ status(esk1_2(X9,X10),esk2_2(X9,X10),X10)
| isa(X9,X10) )
& ( ~ isa(X9,X10)
| ~ status(X13,X14,X9)
| status(X13,X14,X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[isa])])])])])])]) ).
fof(c_0_6,plain,
! [X4,X5,X4,X5,X7] :
( ( model(esk3_2(X4,X5),X4)
| status(X4,X5,thm) )
& ( ~ model(esk3_2(X4,X5),X5)
| status(X4,X5,thm) )
& ( ~ status(X4,X5,thm)
| ~ model(X7,X4)
| model(X7,X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[thm])])])])])])]) ).
cnf(c_0_7,plain,
( model(X3,X2)
| ~ status(X1,X2,tau) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( isa(X1,X2)
| status(esk1_2(X1,X2),esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,negated_conjecture,
~ isa(tau,thm),
inference(assume_negation,[status(cth)],[isa_tau_thm]) ).
cnf(c_0_10,plain,
( status(X1,X2,thm)
| ~ model(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( isa(tau,X1)
| model(X2,esk2_2(tau,X1)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
fof(c_0_12,negated_conjecture,
~ isa(tau,thm),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( isa(X1,X2)
| ~ status(esk1_2(X1,X2),esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( isa(tau,X1)
| status(X2,esk2_2(tau,X1),thm) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
~ isa(tau,thm),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS190+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 7 15:05:51 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.22/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.42 # Preprocessing time : 0.016 s
% 0.22/1.42
% 0.22/1.42 # Proof found!
% 0.22/1.42 # SZS status Theorem
% 0.22/1.42 # SZS output start CNFRefutation
% See solution above
% 0.22/1.42 # Proof object total steps : 17
% 0.22/1.42 # Proof object clause steps : 8
% 0.22/1.42 # Proof object formula steps : 9
% 0.22/1.42 # Proof object conjectures : 4
% 0.22/1.42 # Proof object clause conjectures : 1
% 0.22/1.42 # Proof object formula conjectures : 3
% 0.22/1.42 # Proof object initial clauses used : 5
% 0.22/1.42 # Proof object initial formulas used : 4
% 0.22/1.42 # Proof object generating inferences : 3
% 0.22/1.42 # Proof object simplifying inferences : 1
% 0.22/1.42 # Training examples: 0 positive, 0 negative
% 0.22/1.42 # Parsed axioms : 33
% 0.22/1.42 # Removed by relevancy pruning/SinE : 23
% 0.22/1.42 # Initial clauses : 25
% 0.22/1.42 # Removed in clause preprocessing : 0
% 0.22/1.42 # Initial clauses in saturation : 25
% 0.22/1.42 # Processed clauses : 66
% 0.22/1.42 # ...of these trivial : 0
% 0.22/1.42 # ...subsumed : 10
% 0.22/1.42 # ...remaining for further processing : 56
% 0.22/1.42 # Other redundant clauses eliminated : 0
% 0.22/1.42 # Clauses deleted for lack of memory : 0
% 0.22/1.42 # Backward-subsumed : 0
% 0.22/1.42 # Backward-rewritten : 0
% 0.22/1.42 # Generated clauses : 68
% 0.22/1.42 # ...of the previous two non-trivial : 53
% 0.22/1.42 # Contextual simplify-reflections : 1
% 0.22/1.42 # Paramodulations : 68
% 0.22/1.42 # Factorizations : 0
% 0.22/1.42 # Equation resolutions : 0
% 0.22/1.42 # Current number of processed clauses : 56
% 0.22/1.42 # Positive orientable unit clauses : 14
% 0.22/1.42 # Positive unorientable unit clauses: 0
% 0.22/1.42 # Negative unit clauses : 7
% 0.22/1.42 # Non-unit-clauses : 35
% 0.22/1.42 # Current number of unprocessed clauses: 12
% 0.22/1.42 # ...number of literals in the above : 38
% 0.22/1.42 # Current number of archived formulas : 0
% 0.22/1.42 # Current number of archived clauses : 0
% 0.22/1.42 # Clause-clause subsumption calls (NU) : 88
% 0.22/1.42 # Rec. Clause-clause subsumption calls : 70
% 0.22/1.42 # Non-unit clause-clause subsumptions : 10
% 0.22/1.42 # Unit Clause-clause subsumption calls : 25
% 0.22/1.42 # Rewrite failures with RHS unbound : 0
% 0.22/1.42 # BW rewrite match attempts : 14
% 0.22/1.42 # BW rewrite match successes : 0
% 0.22/1.42 # Condensation attempts : 0
% 0.22/1.42 # Condensation successes : 0
% 0.22/1.42 # Termbank termtop insertions : 2504
% 0.22/1.42
% 0.22/1.42 # -------------------------------------------------
% 0.22/1.42 # User time : 0.017 s
% 0.22/1.42 # System time : 0.002 s
% 0.22/1.42 # Total time : 0.019 s
% 0.22/1.42 # Maximum resident set size: 3024 pages
%------------------------------------------------------------------------------