TSTP Solution File: SYN417+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SYN417+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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:54:07 EDT 2022
% Result : Theorem 0.23s 1.40s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 47
% Number of leaves : 1
% Syntax : Number of formulae : 59 ( 8 unt; 0 def)
% Number of atoms : 193 ( 192 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 200 ( 66 ~; 117 |; 11 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-1 aty)
% Number of variables : 50 ( 0 sgn 8 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cute,conjecture,
( ? [X1] :
( X1 = f(g(X1))
& ! [X2] :
( X2 = f(g(X2))
=> X1 = X2 ) )
<=> ? [X1] :
( X1 = g(f(X1))
& ! [X2] :
( X2 = g(f(X2))
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',cute) ).
fof(c_0_1,negated_conjecture,
~ ( ? [X1] :
( X1 = f(g(X1))
& ! [X2] :
( X2 = f(g(X2))
=> X1 = X2 ) )
<=> ? [X1] :
( X1 = g(f(X1))
& ! [X2] :
( X2 = g(f(X2))
=> X1 = X2 ) ) ),
inference(assume_negation,[status(cth)],[cute]) ).
fof(c_0_2,negated_conjecture,
! [X3,X5,X8,X10] :
( ( esk2_1(X5) = g(f(esk2_1(X5)))
| X5 != g(f(X5))
| esk1_1(X3) = f(g(esk1_1(X3)))
| X3 != f(g(X3)) )
& ( X5 != esk2_1(X5)
| X5 != g(f(X5))
| esk1_1(X3) = f(g(esk1_1(X3)))
| X3 != f(g(X3)) )
& ( esk2_1(X5) = g(f(esk2_1(X5)))
| X5 != g(f(X5))
| X3 != esk1_1(X3)
| X3 != f(g(X3)) )
& ( X5 != esk2_1(X5)
| X5 != g(f(X5))
| X3 != esk1_1(X3)
| X3 != f(g(X3)) )
& ( esk4_0 = g(f(esk4_0))
| esk3_0 = f(g(esk3_0)) )
& ( X10 != g(f(X10))
| esk4_0 = X10
| esk3_0 = f(g(esk3_0)) )
& ( esk4_0 = g(f(esk4_0))
| X8 != f(g(X8))
| esk3_0 = X8 )
& ( X10 != g(f(X10))
| esk4_0 = X10
| X8 != f(g(X8))
| esk3_0 = X8 ) ),
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)],[c_0_1])])])])])])]) ).
cnf(c_0_3,negated_conjecture,
( esk1_1(X1) = f(g(esk1_1(X1)))
| esk2_1(X2) = g(f(esk2_1(X2)))
| X1 != f(g(X1))
| X2 != g(f(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( esk3_0 = f(g(esk3_0))
| esk4_0 = g(f(esk4_0)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( g(f(esk2_1(g(esk3_0)))) = esk2_1(g(esk3_0))
| f(g(esk1_1(X1))) = esk1_1(X1)
| g(f(esk4_0)) = esk4_0
| f(g(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,negated_conjecture,
( esk3_0 = X1
| esk4_0 = g(f(esk4_0))
| X1 != f(g(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
( g(f(esk2_1(g(esk3_0)))) = esk2_1(g(esk3_0))
| f(g(esk1_1(esk3_0))) = esk1_1(esk3_0)
| g(f(esk4_0)) = esk4_0 ),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( f(g(esk1_1(esk3_0))) = esk1_1(esk3_0)
| f(esk2_1(g(esk3_0))) = esk3_0
| g(f(esk4_0)) = esk4_0 ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
( f(g(esk1_1(esk3_0))) = esk1_1(esk3_0)
| esk2_1(g(esk3_0)) = g(esk3_0)
| g(f(esk4_0)) = esk4_0 ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,negated_conjecture,
( esk1_1(X1) = f(g(esk1_1(X1)))
| X1 != f(g(X1))
| X2 != g(f(X2))
| X2 != esk2_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( f(g(esk1_1(esk3_0))) = esk1_1(esk3_0)
| g(f(g(esk3_0))) = g(esk3_0)
| g(f(esk4_0)) = esk4_0 ),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( f(g(esk1_1(esk3_0))) = esk1_1(esk3_0)
| f(g(esk1_1(X1))) = esk1_1(X1)
| g(f(esk4_0)) = esk4_0
| f(g(X1)) != X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_9]),c_0_11]) ).
cnf(c_0_13,negated_conjecture,
( f(g(esk1_1(esk3_0))) = esk1_1(esk3_0)
| g(f(esk4_0)) = esk4_0 ),
inference(spm,[status(thm)],[c_0_12,c_0_4]) ).
cnf(c_0_14,negated_conjecture,
( esk2_1(X2) = g(f(esk2_1(X2)))
| X1 != f(g(X1))
| X1 != esk1_1(X1)
| X2 != g(f(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,negated_conjecture,
( g(f(esk4_0)) = esk4_0
| esk1_1(esk3_0) = esk3_0 ),
inference(spm,[status(thm)],[c_0_6,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( g(f(esk2_1(X1))) = esk2_1(X1)
| g(f(esk4_0)) = esk4_0
| g(f(X1)) != X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_4]) ).
cnf(c_0_17,negated_conjecture,
( g(f(esk4_0)) = esk4_0
| f(esk2_1(X1)) = esk3_0
| g(f(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_6,c_0_16]) ).
cnf(c_0_18,negated_conjecture,
( X1 != f(g(X1))
| X1 != esk1_1(X1)
| X2 != g(f(X2))
| X2 != esk2_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_19,negated_conjecture,
( g(f(esk4_0)) = esk4_0
| esk2_1(X1) = g(esk3_0)
| g(f(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( g(f(esk4_0)) = esk4_0
| g(f(X1)) != X1
| f(g(X2)) != X2
| g(esk3_0) != X1
| esk1_1(X2) != X2 ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
( g(f(esk4_0)) = esk4_0
| f(g(X1)) != X1
| esk1_1(X1) != X1 ),
inference(spm,[status(thm)],[c_0_20,c_0_4]) ).
cnf(c_0_22,negated_conjecture,
g(f(esk4_0)) = esk4_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_15]),c_0_4]) ).
cnf(c_0_23,negated_conjecture,
( g(f(esk2_1(esk4_0))) = esk2_1(esk4_0)
| f(g(esk1_1(X1))) = esk1_1(X1)
| f(g(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_3,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
( esk3_0 = f(g(esk3_0))
| esk4_0 = X1
| X1 != g(f(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_25,negated_conjecture,
( f(g(esk1_1(f(esk4_0)))) = esk1_1(f(esk4_0))
| g(f(esk2_1(esk4_0))) = esk2_1(esk4_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( f(g(esk1_1(f(esk4_0)))) = esk1_1(f(esk4_0))
| f(g(esk3_0)) = esk3_0
| esk2_1(esk4_0) = esk4_0 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
( f(g(esk1_1(f(esk4_0)))) = esk1_1(f(esk4_0))
| f(g(esk1_1(X1))) = esk1_1(X1)
| f(g(esk3_0)) = esk3_0
| f(g(X1)) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_26]),c_0_22])]) ).
cnf(c_0_28,negated_conjecture,
( f(g(esk1_1(f(esk4_0)))) = esk1_1(f(esk4_0))
| f(g(esk3_0)) = esk3_0 ),
inference(spm,[status(thm)],[c_0_27,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( g(esk1_1(f(esk4_0))) = esk4_0
| f(g(esk3_0)) = esk3_0 ),
inference(spm,[status(thm)],[c_0_24,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
( esk1_1(f(esk4_0)) = f(esk4_0)
| f(g(esk3_0)) = esk3_0 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,negated_conjecture,
( g(f(esk2_1(X1))) = esk2_1(X1)
| f(g(esk3_0)) = esk3_0
| g(f(X1)) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_30]),c_0_22])]) ).
cnf(c_0_32,negated_conjecture,
( f(g(esk3_0)) = esk3_0
| esk2_1(X1) = esk4_0
| g(f(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_24,c_0_31]) ).
cnf(c_0_33,negated_conjecture,
( f(g(esk3_0)) = esk3_0
| g(f(X1)) != X1
| f(g(X2)) != X2
| esk1_1(X2) != X2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_32]),c_0_24]) ).
cnf(c_0_34,negated_conjecture,
( f(g(esk3_0)) = esk3_0
| f(g(X1)) != X1
| esk1_1(X1) != X1 ),
inference(spm,[status(thm)],[c_0_33,c_0_28]) ).
cnf(c_0_35,negated_conjecture,
( esk3_0 = X1
| esk4_0 = X2
| X1 != f(g(X1))
| X2 != g(f(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_36,negated_conjecture,
f(g(esk3_0)) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_30]),c_0_22])]) ).
cnf(c_0_37,negated_conjecture,
( f(g(esk1_1(f(esk4_0)))) = esk1_1(f(esk4_0))
| esk2_1(esk4_0) = esk4_0
| esk3_0 = X1
| f(g(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_35,c_0_25]) ).
cnf(c_0_38,negated_conjecture,
( g(esk3_0) = esk4_0
| esk3_0 = X1
| f(g(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
( f(g(esk1_1(f(esk4_0)))) = esk1_1(f(esk4_0))
| f(esk2_1(esk4_0)) = esk3_0
| esk2_1(esk4_0) = esk4_0 ),
inference(spm,[status(thm)],[c_0_37,c_0_25]) ).
cnf(c_0_40,negated_conjecture,
( f(esk4_0) = esk3_0
| g(esk3_0) = esk4_0 ),
inference(spm,[status(thm)],[c_0_38,c_0_22]) ).
cnf(c_0_41,negated_conjecture,
( f(g(esk1_1(f(esk4_0)))) = esk1_1(f(esk4_0))
| esk2_1(esk4_0) = g(esk3_0)
| esk2_1(esk4_0) = esk4_0 ),
inference(spm,[status(thm)],[c_0_25,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
g(esk3_0) = esk4_0,
inference(spm,[status(thm)],[c_0_22,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
( f(g(esk1_1(f(esk4_0)))) = esk1_1(f(esk4_0))
| esk2_1(esk4_0) = esk4_0
| g(esk3_0) != esk4_0 ),
inference(ef,[status(thm)],[c_0_41]) ).
cnf(c_0_44,negated_conjecture,
f(esk4_0) = esk3_0,
inference(rw,[status(thm)],[c_0_36,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
( f(g(esk1_1(esk3_0))) = esk1_1(esk3_0)
| esk2_1(esk4_0) = esk4_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_42])]),c_0_44]),c_0_44]) ).
cnf(c_0_46,negated_conjecture,
( f(g(esk1_1(esk3_0))) = esk1_1(esk3_0)
| f(g(esk1_1(X1))) = esk1_1(X1)
| f(g(X1)) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_45]),c_0_44]),c_0_42])]) ).
cnf(c_0_47,negated_conjecture,
f(g(esk1_1(esk3_0))) = esk1_1(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_42]),c_0_44])]) ).
cnf(c_0_48,negated_conjecture,
( g(esk1_1(esk3_0)) = esk4_0
| esk3_0 = X1
| f(g(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_35,c_0_47]) ).
cnf(c_0_49,negated_conjecture,
( g(esk1_1(esk3_0)) = esk4_0
| esk1_1(esk3_0) = esk3_0 ),
inference(spm,[status(thm)],[c_0_48,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
esk1_1(esk3_0) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_49]),c_0_44])]) ).
cnf(c_0_51,negated_conjecture,
( g(f(esk2_1(X1))) = esk2_1(X1)
| g(f(X1)) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_50]),c_0_42]),c_0_44])]) ).
cnf(c_0_52,negated_conjecture,
( esk2_1(X1) = esk4_0
| esk3_0 = X2
| f(g(X2)) != X2
| g(f(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_35,c_0_51]) ).
cnf(c_0_53,negated_conjecture,
( f(esk2_1(X1)) = esk3_0
| esk2_1(X2) = esk4_0
| g(f(X2)) != X2
| g(f(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_52,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
( f(esk2_1(X1)) = esk3_0
| esk2_1(esk4_0) = esk4_0
| g(f(X1)) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_44]),c_0_42])]) ).
cnf(c_0_55,negated_conjecture,
( f(esk2_1(esk4_0)) = esk3_0
| esk2_1(esk4_0) = esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_44]),c_0_42])]) ).
cnf(c_0_56,negated_conjecture,
esk2_1(esk4_0) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_55]),c_0_42]),c_0_44]),c_0_42])]) ).
cnf(c_0_57,negated_conjecture,
( f(g(X1)) != X1
| esk1_1(X1) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_56]),c_0_44]),c_0_42])]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_50]),c_0_42]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYN417+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jul 12 02:45:08 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.23/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.40 # Preprocessing time : 0.013 s
% 0.23/1.40
% 0.23/1.40 # Proof found!
% 0.23/1.40 # SZS status Theorem
% 0.23/1.40 # SZS output start CNFRefutation
% See solution above
% 0.23/1.40 # Proof object total steps : 59
% 0.23/1.40 # Proof object clause steps : 56
% 0.23/1.40 # Proof object formula steps : 3
% 0.23/1.40 # Proof object conjectures : 59
% 0.23/1.40 # Proof object clause conjectures : 56
% 0.23/1.40 # Proof object formula conjectures : 3
% 0.23/1.40 # Proof object initial clauses used : 8
% 0.23/1.40 # Proof object initial formulas used : 1
% 0.23/1.40 # Proof object generating inferences : 46
% 0.23/1.40 # Proof object simplifying inferences : 39
% 0.23/1.40 # Training examples: 0 positive, 0 negative
% 0.23/1.40 # Parsed axioms : 1
% 0.23/1.40 # Removed by relevancy pruning/SinE : 0
% 0.23/1.40 # Initial clauses : 8
% 0.23/1.40 # Removed in clause preprocessing : 0
% 0.23/1.40 # Initial clauses in saturation : 8
% 0.23/1.40 # Processed clauses : 161
% 0.23/1.40 # ...of these trivial : 5
% 0.23/1.40 # ...subsumed : 58
% 0.23/1.40 # ...remaining for further processing : 98
% 0.23/1.40 # Other redundant clauses eliminated : 0
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 28
% 0.23/1.40 # Backward-rewritten : 59
% 0.23/1.40 # Generated clauses : 368
% 0.23/1.40 # ...of the previous two non-trivial : 321
% 0.23/1.40 # Contextual simplify-reflections : 95
% 0.23/1.40 # Paramodulations : 367
% 0.23/1.40 # Factorizations : 1
% 0.23/1.40 # Equation resolutions : 0
% 0.23/1.40 # Current number of processed clauses : 11
% 0.23/1.40 # Positive orientable unit clauses : 4
% 0.23/1.40 # Positive unorientable unit clauses: 0
% 0.23/1.40 # Negative unit clauses : 0
% 0.23/1.40 # Non-unit-clauses : 7
% 0.23/1.40 # Current number of unprocessed clauses: 5
% 0.23/1.40 # ...number of literals in the above : 20
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 87
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 859
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 522
% 0.23/1.40 # Non-unit clause-clause subsumptions : 181
% 0.23/1.40 # Unit Clause-clause subsumption calls : 11
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 9
% 0.23/1.40 # BW rewrite match successes : 7
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 8844
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.031 s
% 0.23/1.40 # System time : 0.002 s
% 0.23/1.40 # Total time : 0.033 s
% 0.23/1.40 # Maximum resident set size: 2760 pages
%------------------------------------------------------------------------------