TSTP Solution File: SYN356+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SYN356+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n022.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 05:53:35 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 7 unt; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 37 ( 11 ~; 8 |; 12 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 18 ( 1 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(x2107,conjecture,
( ( big_r(a,b)
& ! [X1,X2] :
( big_r(X1,X2)
=> ( big_r(X2,X1)
& big_q(X1,X2) ) )
& ! [X3,X4] :
( big_q(X3,X4)
=> big_q(X3,X3) ) )
=> ( big_q(a,a)
& big_q(b,b) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',x2107) ).
fof(c_0_1,negated_conjecture,
~ ( ( big_r(a,b)
& ! [X1,X2] :
( big_r(X1,X2)
=> ( big_r(X2,X1)
& big_q(X1,X2) ) )
& ! [X3,X4] :
( big_q(X3,X4)
=> big_q(X3,X3) ) )
=> ( big_q(a,a)
& big_q(b,b) ) ),
inference(assume_negation,[status(cth)],[x2107]) ).
fof(c_0_2,negated_conjecture,
! [X5,X6,X7,X8] :
( big_r(a,b)
& ( big_r(X6,X5)
| ~ big_r(X5,X6) )
& ( big_q(X5,X6)
| ~ big_r(X5,X6) )
& ( ~ big_q(X7,X8)
| big_q(X7,X7) )
& ( ~ big_q(a,a)
| ~ big_q(b,b) ) ),
inference(distribute,[status(thm)],[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)],[c_0_1])])])])])]) ).
cnf(c_0_3,negated_conjecture,
( big_r(X2,X1)
| ~ big_r(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
big_r(a,b),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( big_q(X1,X2)
| ~ big_r(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
big_r(b,a),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( big_q(X1,X1)
| ~ big_q(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
big_q(a,b),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_9,negated_conjecture,
big_q(b,a),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( ~ big_q(b,b)
| ~ big_q(a,a) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
big_q(a,a),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
big_q(b,b),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN356+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jul 12 03:12:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.013 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 14
% 0.22/1.41 # Proof object clause steps : 11
% 0.22/1.41 # Proof object formula steps : 3
% 0.22/1.41 # Proof object conjectures : 14
% 0.22/1.41 # Proof object clause conjectures : 11
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 5
% 0.22/1.41 # Proof object initial formulas used : 1
% 0.22/1.41 # Proof object generating inferences : 5
% 0.22/1.41 # Proof object simplifying inferences : 4
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 1
% 0.22/1.41 # Removed by relevancy pruning/SinE : 0
% 0.22/1.41 # Initial clauses : 5
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 5
% 0.22/1.41 # Processed clauses : 11
% 0.22/1.41 # ...of these trivial : 0
% 0.22/1.41 # ...subsumed : 0
% 0.22/1.41 # ...remaining for further processing : 10
% 0.22/1.41 # Other redundant clauses eliminated : 0
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 0
% 0.22/1.41 # Backward-rewritten : 1
% 0.22/1.41 # Generated clauses : 8
% 0.22/1.41 # ...of the previous two non-trivial : 6
% 0.22/1.41 # Contextual simplify-reflections : 0
% 0.22/1.41 # Paramodulations : 8
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 0
% 0.22/1.41 # Current number of processed clauses : 9
% 0.22/1.41 # Positive orientable unit clauses : 6
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 0
% 0.22/1.41 # Non-unit-clauses : 3
% 0.22/1.41 # Current number of unprocessed clauses: 0
% 0.22/1.41 # ...number of literals in the above : 0
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 1
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 0
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 0
% 0.22/1.41 # Non-unit clause-clause subsumptions : 0
% 0.22/1.41 # Unit Clause-clause subsumption calls : 0
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 1
% 0.22/1.41 # BW rewrite match successes : 1
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 362
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.013 s
% 0.22/1.41 # System time : 0.001 s
% 0.22/1.41 # Total time : 0.014 s
% 0.22/1.41 # Maximum resident set size: 2764 pages
%------------------------------------------------------------------------------