TSTP Solution File: SWW345+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWW345+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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 : Thu Jul 21 00:10:37 EDT 2022
% Result : Theorem 0.98s 2.17s
% Output : CNFRefutation 0.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 12 unt; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 28 ( 14 ~; 10 |; 0 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 20 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_6,conjecture,
v_R(v_Z,v_s_H),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj_6) ).
fof(conj_2,hypothesis,
! [X9,X10] :
( v_Q(X9,X10)
=> ! [X11] :
( c_Natural_Oevaln(v_d,X10,v_n,X11)
=> v_R(X9,X11) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj_2) ).
fof(conj_5,hypothesis,
c_Natural_Oevaln(v_d,v_s1,v_n,v_s_H),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj_5) ).
fof(conj_1,hypothesis,
! [X9,X10] :
( v_P(X9,X10)
=> ! [X11] :
( c_Natural_Oevaln(v_c,X10,v_n,X11)
=> v_Q(X9,X11) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj_1) ).
fof(conj_4,hypothesis,
c_Natural_Oevaln(v_c,v_s,v_n,v_s1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj_4) ).
fof(conj_3,hypothesis,
v_P(v_Z,v_s),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj_3) ).
fof(c_0_6,negated_conjecture,
~ v_R(v_Z,v_s_H),
inference(assume_negation,[status(cth)],[conj_6]) ).
fof(c_0_7,hypothesis,
! [X12,X13,X14] :
( ~ v_Q(X12,X13)
| ~ c_Natural_Oevaln(v_d,X13,v_n,X14)
| v_R(X12,X14) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_2])])])])]) ).
fof(c_0_8,negated_conjecture,
~ v_R(v_Z,v_s_H),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
cnf(c_0_9,hypothesis,
( v_R(X1,X2)
| ~ c_Natural_Oevaln(v_d,X3,v_n,X2)
| ~ v_Q(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
c_Natural_Oevaln(v_d,v_s1,v_n,v_s_H),
inference(split_conjunct,[status(thm)],[conj_5]) ).
fof(c_0_11,hypothesis,
! [X12,X13,X14] :
( ~ v_P(X12,X13)
| ~ c_Natural_Oevaln(v_c,X13,v_n,X14)
| v_Q(X12,X14) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_1])])])])]) ).
cnf(c_0_12,negated_conjecture,
~ v_R(v_Z,v_s_H),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
( v_R(X1,v_s_H)
| ~ v_Q(X1,v_s1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,hypothesis,
( v_Q(X1,X2)
| ~ c_Natural_Oevaln(v_c,X3,v_n,X2)
| ~ v_P(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,hypothesis,
c_Natural_Oevaln(v_c,v_s,v_n,v_s1),
inference(split_conjunct,[status(thm)],[conj_4]) ).
cnf(c_0_16,negated_conjecture,
~ v_Q(v_Z,v_s1),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,hypothesis,
( v_Q(X1,v_s1)
| ~ v_P(X1,v_s) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,hypothesis,
v_P(v_Z,v_s),
inference(split_conjunct,[status(thm)],[conj_3]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SWW345+1 : TPTP v8.1.0. Released v5.2.0.
% 0.14/0.15 % Command : run_ET %s %d
% 0.15/0.37 % Computer : n027.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 600
% 0.15/0.37 % DateTime : Sun Jun 5 17:52:23 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.98/2.17 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.98/2.17 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.98/2.17 # Preprocessing time : 0.254 s
% 0.98/2.17
% 0.98/2.17 # Proof found!
% 0.98/2.17 # SZS status Theorem
% 0.98/2.17 # SZS output start CNFRefutation
% See solution above
% 0.98/2.17 # Proof object total steps : 20
% 0.98/2.17 # Proof object clause steps : 10
% 0.98/2.17 # Proof object formula steps : 10
% 0.98/2.17 # Proof object conjectures : 6
% 0.98/2.17 # Proof object clause conjectures : 3
% 0.98/2.17 # Proof object formula conjectures : 3
% 0.98/2.17 # Proof object initial clauses used : 6
% 0.98/2.17 # Proof object initial formulas used : 6
% 0.98/2.17 # Proof object generating inferences : 4
% 0.98/2.17 # Proof object simplifying inferences : 2
% 0.98/2.17 # Training examples: 0 positive, 0 negative
% 0.98/2.17 # Parsed axioms : 5211
% 0.98/2.17 # Removed by relevancy pruning/SinE : 5110
% 0.98/2.17 # Initial clauses : 177
% 0.98/2.17 # Removed in clause preprocessing : 17
% 0.98/2.17 # Initial clauses in saturation : 160
% 0.98/2.17 # Processed clauses : 168
% 0.98/2.17 # ...of these trivial : 3
% 0.98/2.17 # ...subsumed : 38
% 0.98/2.17 # ...remaining for further processing : 127
% 0.98/2.17 # Other redundant clauses eliminated : 17
% 0.98/2.17 # Clauses deleted for lack of memory : 0
% 0.98/2.17 # Backward-subsumed : 0
% 0.98/2.17 # Backward-rewritten : 1
% 0.98/2.17 # Generated clauses : 672
% 0.98/2.17 # ...of the previous two non-trivial : 604
% 0.98/2.17 # Contextual simplify-reflections : 1
% 0.98/2.17 # Paramodulations : 646
% 0.98/2.17 # Factorizations : 0
% 0.98/2.17 # Equation resolutions : 26
% 0.98/2.17 # Current number of processed clauses : 123
% 0.98/2.17 # Positive orientable unit clauses : 16
% 0.98/2.17 # Positive unorientable unit clauses: 0
% 0.98/2.17 # Negative unit clauses : 4
% 0.98/2.17 # Non-unit-clauses : 103
% 0.98/2.17 # Current number of unprocessed clauses: 589
% 0.98/2.17 # ...number of literals in the above : 1826
% 0.98/2.17 # Current number of archived formulas : 0
% 0.98/2.17 # Current number of archived clauses : 1
% 0.98/2.17 # Clause-clause subsumption calls (NU) : 1171
% 0.98/2.17 # Rec. Clause-clause subsumption calls : 1115
% 0.98/2.17 # Non-unit clause-clause subsumptions : 33
% 0.98/2.17 # Unit Clause-clause subsumption calls : 70
% 0.98/2.17 # Rewrite failures with RHS unbound : 0
% 0.98/2.17 # BW rewrite match attempts : 24
% 0.98/2.17 # BW rewrite match successes : 1
% 0.98/2.17 # Condensation attempts : 0
% 0.98/2.17 # Condensation successes : 0
% 0.98/2.17 # Termbank termtop insertions : 156070
% 0.98/2.17
% 0.98/2.17 # -------------------------------------------------
% 0.98/2.17 # User time : 0.260 s
% 0.98/2.17 # System time : 0.011 s
% 0.98/2.17 # Total time : 0.271 s
% 0.98/2.17 # Maximum resident set size: 14116 pages
%------------------------------------------------------------------------------