TSTP Solution File: CSR101+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR101+4 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n008.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 : Fri Jul 15 03:02:44 EDT 2022
% Result : Theorem 0.96s 2.14s
% Output : CNFRefutation 0.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 8 unt; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 46 ( 20 ~; 16 |; 5 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 24 ( 2 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_27,axiom,
! [X6,X7,X8] :
( ( s__instance(X7,s__SetOrClass)
& s__instance(X6,s__SetOrClass) )
=> ( ( s__subclass(X6,X7)
& s__instance(X8,X6) )
=> s__instance(X8,X7) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_27) ).
fof(kb_SUMO_26,axiom,
! [X6,X7] :
( s__subclass(X6,X7)
=> ( s__instance(X6,s__SetOrClass)
& s__instance(X7,s__SetOrClass) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_26) ).
fof(prove_from_SUMO,conjecture,
! [X591] :
( s__instance(X591,s__Class32_2)
=> s__instance(X591,s__Class32_1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_from_SUMO) ).
fof(local_9,axiom,
s__subclass(s__Class32_3,s__Class32_1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',local_9) ).
fof(local_8,axiom,
s__subclass(s__Class32_2,s__Class32_3),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',local_8) ).
fof(c_0_5,plain,
! [X9,X10,X11] :
( ~ s__instance(X10,s__SetOrClass)
| ~ s__instance(X9,s__SetOrClass)
| ~ s__subclass(X9,X10)
| ~ s__instance(X11,X9)
| s__instance(X11,X10) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])])]) ).
fof(c_0_6,plain,
! [X8,X9] :
( ( s__instance(X8,s__SetOrClass)
| ~ s__subclass(X8,X9) )
& ( s__instance(X9,s__SetOrClass)
| ~ s__subclass(X8,X9) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X591] :
( s__instance(X591,s__Class32_2)
=> s__instance(X591,s__Class32_1) ),
inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).
cnf(c_0_8,plain,
( s__instance(X1,X2)
| ~ s__instance(X1,X3)
| ~ s__subclass(X3,X2)
| ~ s__instance(X3,s__SetOrClass)
| ~ s__instance(X2,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( s__instance(X2,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,negated_conjecture,
( s__instance(esk1_0,s__Class32_2)
& ~ s__instance(esk1_0,s__Class32_1) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_12,plain,
( s__instance(X1,X2)
| ~ s__subclass(X3,X2)
| ~ s__instance(X1,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_13,plain,
s__subclass(s__Class32_3,s__Class32_1),
inference(split_conjunct,[status(thm)],[local_9]) ).
cnf(c_0_14,plain,
s__subclass(s__Class32_2,s__Class32_3),
inference(split_conjunct,[status(thm)],[local_8]) ).
cnf(c_0_15,negated_conjecture,
~ s__instance(esk1_0,s__Class32_1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( s__instance(X1,s__Class32_1)
| ~ s__instance(X1,s__Class32_3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( s__instance(X1,s__Class32_3)
| ~ s__instance(X1,s__Class32_2) ),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
s__instance(esk1_0,s__Class32_2),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
~ s__instance(esk1_0,s__Class32_3),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : CSR101+4 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.10/0.13 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n008.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 11 01:34:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.96/2.14 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.96/2.14 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.96/2.14 # Preprocessing time : 0.182 s
% 0.96/2.14
% 0.96/2.14 # Proof found!
% 0.96/2.14 # SZS status Theorem
% 0.96/2.14 # SZS output start CNFRefutation
% See solution above
% 0.96/2.14 # Proof object total steps : 21
% 0.96/2.14 # Proof object clause steps : 12
% 0.96/2.14 # Proof object formula steps : 9
% 0.96/2.14 # Proof object conjectures : 7
% 0.96/2.14 # Proof object clause conjectures : 4
% 0.96/2.14 # Proof object formula conjectures : 3
% 0.96/2.14 # Proof object initial clauses used : 7
% 0.96/2.14 # Proof object initial formulas used : 5
% 0.96/2.14 # Proof object generating inferences : 4
% 0.96/2.14 # Proof object simplifying inferences : 3
% 0.96/2.14 # Training examples: 0 positive, 0 negative
% 0.96/2.14 # Parsed axioms : 7227
% 0.96/2.14 # Removed by relevancy pruning/SinE : 7170
% 0.96/2.14 # Initial clauses : 63
% 0.96/2.14 # Removed in clause preprocessing : 4
% 0.96/2.14 # Initial clauses in saturation : 59
% 0.96/2.14 # Processed clauses : 73
% 0.96/2.14 # ...of these trivial : 12
% 0.96/2.14 # ...subsumed : 0
% 0.96/2.14 # ...remaining for further processing : 61
% 0.96/2.14 # Other redundant clauses eliminated : 0
% 0.96/2.14 # Clauses deleted for lack of memory : 0
% 0.96/2.14 # Backward-subsumed : 0
% 0.96/2.14 # Backward-rewritten : 1
% 0.96/2.14 # Generated clauses : 91
% 0.96/2.14 # ...of the previous two non-trivial : 78
% 0.96/2.14 # Contextual simplify-reflections : 11
% 0.96/2.14 # Paramodulations : 91
% 0.96/2.14 # Factorizations : 0
% 0.96/2.14 # Equation resolutions : 0
% 0.96/2.14 # Current number of processed clauses : 60
% 0.96/2.14 # Positive orientable unit clauses : 24
% 0.96/2.14 # Positive unorientable unit clauses: 0
% 0.96/2.14 # Negative unit clauses : 2
% 0.96/2.14 # Non-unit-clauses : 34
% 0.96/2.14 # Current number of unprocessed clauses: 64
% 0.96/2.14 # ...number of literals in the above : 114
% 0.96/2.14 # Current number of archived formulas : 0
% 0.96/2.14 # Current number of archived clauses : 1
% 0.96/2.14 # Clause-clause subsumption calls (NU) : 159
% 0.96/2.14 # Rec. Clause-clause subsumption calls : 104
% 0.96/2.14 # Non-unit clause-clause subsumptions : 11
% 0.96/2.14 # Unit Clause-clause subsumption calls : 25
% 0.96/2.14 # Rewrite failures with RHS unbound : 0
% 0.96/2.14 # BW rewrite match attempts : 1
% 0.96/2.14 # BW rewrite match successes : 1
% 0.96/2.14 # Condensation attempts : 0
% 0.96/2.14 # Condensation successes : 0
% 0.96/2.14 # Termbank termtop insertions : 80923
% 0.96/2.14
% 0.96/2.14 # -------------------------------------------------
% 0.96/2.14 # User time : 0.172 s
% 0.96/2.14 # System time : 0.013 s
% 0.96/2.14 # Total time : 0.185 s
% 0.96/2.14 # Maximum resident set size: 18552 pages
% 0.96/24.56 eprover: CPU time limit exceeded, terminating
% 0.96/24.57 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.96/24.57 eprover: No such file or directory
% 0.96/24.58 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.96/24.58 eprover: No such file or directory
% 0.96/24.59 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.96/24.59 eprover: No such file or directory
% 0.96/24.59 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.96/24.59 eprover: No such file or directory
% 0.96/24.60 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.96/24.60 eprover: No such file or directory
% 0.96/24.60 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.96/24.60 eprover: No such file or directory
% 0.96/24.61 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.96/24.61 eprover: No such file or directory
% 0.96/24.61 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.96/24.61 eprover: No such file or directory
%------------------------------------------------------------------------------