TSTP Solution File: SYN551+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN551+3 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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 04:55:34 EDT 2022
% Result : Theorem 8.34s 2.41s
% Output : CNFRefutation 8.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 56 ( 6 unt; 0 def)
% Number of atoms : 170 ( 96 equ)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 190 ( 76 ~; 108 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 7 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-1 aty)
% Number of variables : 42 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,negated_conjecture,
( f(g(esk3_0)) = esk3_0
| g(f(esk4_0)) = esk4_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jspvxft3/input.p',i_0_4) ).
cnf(i_0_1,negated_conjecture,
( X1 = esk3_0
| X2 = esk4_0
| f(g(X1)) != X1
| g(f(X2)) != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jspvxft3/input.p',i_0_1) ).
cnf(i_0_5,negated_conjecture,
( esk1_1(X1) != X1
| esk2_1(X2) != X2
| f(g(X1)) != X1
| g(f(X2)) != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jspvxft3/input.p',i_0_5) ).
cnf(i_0_6,negated_conjecture,
( g(f(esk2_1(X1))) = esk2_1(X1)
| esk1_1(X2) != X2
| f(g(X2)) != X2
| g(f(X1)) != X1 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jspvxft3/input.p',i_0_6) ).
cnf(i_0_7,negated_conjecture,
( f(g(esk1_1(X1))) = esk1_1(X1)
| esk2_1(X2) != X2
| f(g(X1)) != X1
| g(f(X2)) != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jspvxft3/input.p',i_0_7) ).
cnf(i_0_8,negated_conjecture,
( f(g(esk1_1(X1))) = esk1_1(X1)
| g(f(esk2_1(X2))) = esk2_1(X2)
| f(g(X1)) != X1
| g(f(X2)) != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jspvxft3/input.p',i_0_8) ).
fof(c_0_15,plain,
( ~ epred1_0
<=> ! [X1] :
( X1 = esk3_0
| f(g(X1)) != X1 ) ),
introduced(definition) ).
fof(c_0_16,plain,
( ~ epred5_0
<=> ! [X1] :
( g(f(esk2_1(X1))) = esk2_1(X1)
| g(f(X1)) != X1 ) ),
introduced(definition) ).
cnf(c_0_17,negated_conjecture,
( X1 = esk3_0
| epred1_0
| f(g(X1)) != X1 ),
inference(split_equiv,[status(thm)],[c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( g(f(esk2_1(X1))) = esk2_1(X1)
| epred5_0
| g(f(X1)) != X1 ),
inference(split_equiv,[status(thm)],[c_0_16]) ).
fof(c_0_19,plain,
( ~ epred3_0
<=> ! [X2] :
( esk2_1(X2) != X2
| g(f(X2)) != X2 ) ),
introduced(definition) ).
cnf(c_0_20,negated_conjecture,
( f(esk2_1(X1)) = esk3_0
| epred5_0
| epred1_0
| g(f(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_21,plain,
( ~ epred2_0
<=> ! [X2] :
( X2 = esk4_0
| g(f(X2)) != X2 ) ),
introduced(definition) ).
cnf(c_0_22,negated_conjecture,
( epred3_0
| g(f(X1)) != X1
| esk2_1(X1) != X1 ),
inference(split_equiv,[status(thm)],[c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( esk2_1(X1) = g(esk3_0)
| epred5_0
| epred1_0
| g(f(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( X1 = esk4_0
| epred2_0
| g(f(X1)) != X1 ),
inference(split_equiv,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( f(g(esk3_0)) = esk3_0
| g(f(esk4_0)) = esk4_0 ),
i_0_4 ).
fof(c_0_26,plain,
( ~ epred6_0
<=> ! [X1] :
( f(g(esk1_1(X1))) = esk1_1(X1)
| f(g(X1)) != X1 ) ),
introduced(definition) ).
cnf(c_0_27,negated_conjecture,
( epred5_0
| epred3_0
| epred1_0
| g(f(X1)) != X1
| g(esk3_0) != X1 ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( g(f(esk4_0)) = esk4_0
| g(esk3_0) = esk4_0
| epred2_0 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_29,plain,
( ~ epred4_0
<=> ! [X1] :
( esk1_1(X1) != X1
| f(g(X1)) != X1 ) ),
introduced(definition) ).
cnf(c_0_30,negated_conjecture,
( f(g(esk1_1(X1))) = esk1_1(X1)
| epred6_0
| f(g(X1)) != X1 ),
inference(split_equiv,[status(thm)],[c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( g(f(esk4_0)) = esk4_0
| epred5_0
| epred3_0
| epred1_0 ),
inference(spm,[status(thm)],[c_0_27,c_0_25]) ).
cnf(c_0_32,negated_conjecture,
( esk2_1(X1) = esk4_0
| epred5_0
| epred2_0
| g(f(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_24,c_0_18]) ).
cnf(c_0_33,negated_conjecture,
( g(f(esk4_0)) = esk4_0
| esk3_0 = f(esk4_0)
| epred2_0 ),
inference(spm,[status(thm)],[c_0_25,c_0_28]) ).
cnf(c_0_34,negated_conjecture,
( epred4_0
| f(g(X1)) != X1
| esk1_1(X1) != X1 ),
inference(split_equiv,[status(thm)],[c_0_29]) ).
cnf(c_0_35,negated_conjecture,
( esk1_1(X1) = esk3_0
| epred6_0
| epred1_0
| f(g(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_17,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
( X1 = esk3_0
| X2 = esk4_0
| f(g(X1)) != X1
| g(f(X2)) != X2 ),
i_0_1 ).
cnf(c_0_37,negated_conjecture,
( epred5_0
| epred3_0
| epred1_0
| g(esk3_0) != esk4_0 ),
inference(spm,[status(thm)],[c_0_27,c_0_31]) ).
cnf(c_0_38,negated_conjecture,
( esk3_0 = f(esk4_0)
| epred5_0
| epred3_0
| epred1_0 ),
inference(spm,[status(thm)],[c_0_17,c_0_31]) ).
cnf(c_0_39,negated_conjecture,
( epred5_0
| epred3_0
| epred2_0
| g(f(X1)) != X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_32]),c_0_24]) ).
cnf(c_0_40,negated_conjecture,
( g(f(esk4_0)) = esk4_0
| epred2_0 ),
inference(spm,[status(thm)],[c_0_28,c_0_33]) ).
cnf(c_0_41,negated_conjecture,
( epred6_0
| epred4_0
| epred1_0
| f(g(X1)) != X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_17]) ).
cnf(c_0_42,negated_conjecture,
( esk1_1(X1) != X1
| esk2_1(X2) != X2
| f(g(X1)) != X1
| g(f(X2)) != X2 ),
i_0_5 ).
cnf(c_0_43,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_36,c_0_15]),c_0_21]) ).
cnf(c_0_44,negated_conjecture,
( epred5_0
| epred3_0
| epred1_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_31]) ).
cnf(c_0_45,negated_conjecture,
( epred5_0
| epred3_0
| epred2_0 ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( g(f(esk2_1(X1))) = esk2_1(X1)
| esk1_1(X2) != X2
| f(g(X2)) != X2
| g(f(X1)) != X1 ),
i_0_6 ).
cnf(c_0_47,negated_conjecture,
( f(g(esk1_1(X1))) = esk1_1(X1)
| esk2_1(X2) != X2
| f(g(X1)) != X1
| g(f(X2)) != X2 ),
i_0_7 ).
cnf(c_0_48,negated_conjecture,
( f(g(esk1_1(X1))) = esk1_1(X1)
| g(f(esk2_1(X2))) = esk2_1(X2)
| f(g(X1)) != X1
| g(f(X2)) != X2 ),
i_0_8 ).
cnf(c_0_49,negated_conjecture,
( g(f(esk4_0)) = esk4_0
| epred6_0
| epred4_0
| epred1_0 ),
inference(spm,[status(thm)],[c_0_41,c_0_25]) ).
cnf(c_0_50,negated_conjecture,
( ~ epred4_0
| ~ epred3_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_42,c_0_19]),c_0_29]) ).
cnf(c_0_51,negated_conjecture,
( epred5_0
| epred3_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_52,negated_conjecture,
( ~ epred5_0
| ~ epred4_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_46,c_0_16]),c_0_29]) ).
cnf(c_0_53,negated_conjecture,
( ~ epred6_0
| ~ epred3_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_47,c_0_26]),c_0_19]) ).
cnf(c_0_54,negated_conjecture,
( ~ epred6_0
| ~ epred5_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_48,c_0_26]),c_0_16]) ).
cnf(c_0_55,negated_conjecture,
( epred6_0
| epred4_0
| epred1_0 ),
inference(spm,[status(thm)],[c_0_41,c_0_49]) ).
cnf(c_0_56,negated_conjecture,
~ epred4_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_57,negated_conjecture,
~ epred6_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_51]),c_0_54]) ).
cnf(c_0_58,negated_conjecture,
( g(esk1_1(X1)) = esk4_0
| epred6_0
| epred2_0
| f(g(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_24,c_0_30]) ).
cnf(c_0_59,negated_conjecture,
epred1_0,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_60,negated_conjecture,
( esk1_1(X1) = f(esk4_0)
| epred6_0
| epred2_0
| f(g(X1)) != X1 ),
inference(spm,[status(thm)],[c_0_30,c_0_58]) ).
cnf(c_0_61,negated_conjecture,
~ epred2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_59])]) ).
cnf(c_0_62,negated_conjecture,
( f(g(X1)) != X1
| f(esk4_0) != X1 ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_60]),c_0_57]),c_0_56]),c_0_61]) ).
cnf(c_0_63,negated_conjecture,
g(f(esk4_0)) = esk4_0,
inference(sr,[status(thm)],[c_0_40,c_0_61]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_62,c_0_63]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SYN551+3 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.08/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n006.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Tue Jul 12 07:24:52 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.17/0.44 # ENIGMATIC: Selected complete mode:
% 8.34/2.41 # ENIGMATIC: Solved by autoschedule:
% 8.34/2.41 # No SInE strategy applied
% 8.34/2.41 # Trying AutoSched0 for 150 seconds
% 8.34/2.41 # AutoSched0-Mode selected heuristic G_N___023_B07_F1_SP_PI_Q7_CS_SP_CO_S0Y
% 8.34/2.41 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.34/2.41 #
% 8.34/2.41 # Preprocessing time : 0.023 s
% 8.34/2.41
% 8.34/2.41 # Proof found!
% 8.34/2.41 # SZS status Theorem
% 8.34/2.41 # SZS output start CNFRefutation
% See solution above
% 8.34/2.41 # Training examples: 0 positive, 0 negative
% 8.34/2.41
% 8.34/2.41 # -------------------------------------------------
% 8.34/2.41 # User time : 0.027 s
% 8.34/2.41 # System time : 0.007 s
% 8.34/2.41 # Total time : 0.034 s
% 8.34/2.41 # Maximum resident set size: 7116 pages
% 8.34/2.41
%------------------------------------------------------------------------------