TSTP Solution File: SYN726+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SYN726+1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n012.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 06:04:53 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 30 ( 10 unt; 0 def)
% Number of atoms : 102 ( 0 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 104 ( 32 ~; 39 |; 20 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 83 ( 5 sgn 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thm400,conjecture,
( ( ( ! [X1,X2,X3] :
( ( p(X1,X2)
& p(X2,X3) )
=> p(X1,X3) )
& ! [X1,X2,X3] :
( ( q(X1,X2)
& q(X2,X3) )
=> q(X1,X3) )
& ! [X1,X2] :
( q(X1,X2)
=> q(X2,X1) )
& ! [X1,X2] :
( p(X1,X2)
| q(X1,X2) ) )
=> ! [X1,X2] : p(X1,X2) )
| ! [X1,X2] : q(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thm400) ).
fof(c_0_1,plain,
( epred1_0
<=> ( ! [X1,X2,X3] :
( ( p(X1,X2)
& p(X2,X3) )
=> p(X1,X3) )
& ! [X1,X2,X3] :
( ( q(X1,X2)
& q(X2,X3) )
=> q(X1,X3) )
& ! [X1,X2] :
( q(X1,X2)
=> q(X2,X1) )
& ! [X1,X2] :
( p(X1,X2)
| q(X1,X2) ) ) ),
introduced(definition) ).
fof(c_0_2,plain,
( epred1_0
=> ( ! [X1,X2,X3] :
( ( p(X1,X2)
& p(X2,X3) )
=> p(X1,X3) )
& ! [X1,X2,X3] :
( ( q(X1,X2)
& q(X2,X3) )
=> q(X1,X3) )
& ! [X1,X2] :
( q(X1,X2)
=> q(X2,X1) )
& ! [X1,X2] :
( p(X1,X2)
| q(X1,X2) ) ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
~ ( ( epred1_0
=> ! [X1,X2] : p(X1,X2) )
| ! [X1,X2] : q(X1,X2) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm400]),c_0_1]) ).
fof(c_0_4,plain,
! [X4,X5,X6,X7,X8,X9,X10,X11,X12,X13] :
( ( ~ p(X4,X5)
| ~ p(X5,X6)
| p(X4,X6)
| ~ epred1_0 )
& ( ~ q(X7,X8)
| ~ q(X8,X9)
| q(X7,X9)
| ~ epred1_0 )
& ( ~ q(X10,X11)
| q(X11,X10)
| ~ epred1_0 )
& ( p(X12,X13)
| q(X12,X13)
| ~ epred1_0 ) ),
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_2])])])])])]) ).
fof(c_0_5,negated_conjecture,
( epred1_0
& ~ p(esk1_0,esk2_0)
& ~ q(esk3_0,esk4_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
cnf(c_0_6,plain,
( p(X1,X2)
| ~ epred1_0
| ~ p(X3,X2)
| ~ p(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( q(X1,X2)
| p(X1,X2)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
( p(X1,X2)
| ~ p(X3,X2)
| ~ p(X1,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).
cnf(c_0_10,plain,
( q(X1,X2)
| p(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7])]) ).
cnf(c_0_11,plain,
( q(X1,X2)
| ~ epred1_0
| ~ q(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
~ p(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
( q(X1,X2)
| ~ epred1_0
| ~ q(X3,X2)
| ~ q(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,plain,
( q(X1,X2)
| p(X3,X2)
| ~ p(X3,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
( q(X1,X2)
| ~ q(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_7])]) ).
cnf(c_0_16,negated_conjecture,
q(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_17,plain,
( q(X1,X2)
| ~ q(X3,X2)
| ~ q(X1,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_7])]) ).
cnf(c_0_18,plain,
( q(X1,X2)
| q(X2,X3)
| p(X1,X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_19,plain,
q(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( q(X1,esk2_0)
| ~ q(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( q(X1,esk2_0)
| q(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_22,plain,
( q(X1,esk1_0)
| ~ q(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_23,plain,
( q(esk2_0,X1)
| ~ q(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_24,plain,
q(X1,esk1_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_21]),c_0_22]) ).
cnf(c_0_25,plain,
q(esk2_0,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_26,plain,
q(X1,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_24])]) ).
cnf(c_0_27,negated_conjecture,
~ q(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_28,plain,
q(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_25]),c_0_26])]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN726+1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n012.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 Jul 12 03:17:12 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.014 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 30
% 0.24/1.42 # Proof object clause steps : 24
% 0.24/1.42 # Proof object formula steps : 6
% 0.24/1.42 # Proof object conjectures : 9
% 0.24/1.42 # Proof object clause conjectures : 6
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 7
% 0.24/1.42 # Proof object initial formulas used : 1
% 0.24/1.42 # Proof object generating inferences : 10
% 0.24/1.42 # Proof object simplifying inferences : 17
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 1
% 0.24/1.42 # Removed by relevancy pruning/SinE : 0
% 0.24/1.42 # Initial clauses : 7
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 7
% 0.24/1.42 # Processed clauses : 27
% 0.24/1.42 # ...of these trivial : 1
% 0.24/1.42 # ...subsumed : 1
% 0.24/1.42 # ...remaining for further processing : 25
% 0.24/1.42 # Other redundant clauses eliminated : 0
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 3
% 0.24/1.42 # Backward-rewritten : 18
% 0.24/1.42 # Generated clauses : 55
% 0.24/1.42 # ...of the previous two non-trivial : 44
% 0.24/1.42 # Contextual simplify-reflections : 1
% 0.24/1.42 # Paramodulations : 55
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 4
% 0.24/1.42 # Positive orientable unit clauses : 2
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 1
% 0.24/1.42 # Non-unit-clauses : 1
% 0.24/1.42 # Current number of unprocessed clauses: 1
% 0.24/1.42 # ...number of literals in the above : 2
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 21
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 57
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 57
% 0.24/1.42 # Non-unit clause-clause subsumptions : 2
% 0.24/1.42 # Unit Clause-clause subsumption calls : 4
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 19
% 0.24/1.42 # BW rewrite match successes : 19
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 978
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.013 s
% 0.24/1.42 # System time : 0.002 s
% 0.24/1.42 # Total time : 0.016 s
% 0.24/1.42 # Maximum resident set size: 2764 pages
%------------------------------------------------------------------------------