TSTP Solution File: SWW950+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWW950+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 00:03:10 EDT 2022
% Result : Theorem 9.28s 2.42s
% Output : CNFRefutation 9.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 32 ( 13 unt; 0 nHn; 25 RR)
% Number of literals : 59 ( 5 equ; 29 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 31 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_47,plain,
constr_xor(X1,constr_ZERO) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-txj4edo_/input.p',i_0_47) ).
cnf(i_0_48,plain,
constr_xor(X1,X2) = constr_xor(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-txj4edo_/input.p',i_0_48) ).
cnf(i_0_75,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_1(X1))
| ~ pred_attacker(tuple_T_in_3(X2,constr_h(constr_xor(X2,constr_xor(name_k0x30,name_ki))))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-txj4edo_/input.p',i_0_75) ).
cnf(i_0_59,plain,
( pred_attacker(tuple_T_in_3(X1,X2))
| ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-txj4edo_/input.p',i_0_59) ).
cnf(i_0_74,plain,
( pred_attacker(tuple_T_out_2(constr_h(constr_xor(X1,constr_xor(name_k0x30,name_ki)))))
| ~ pred_attacker(tuple_T_in_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-txj4edo_/input.p',i_0_74) ).
cnf(i_0_54,plain,
pred_attacker(constr_ZERO),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-txj4edo_/input.p',i_0_54) ).
cnf(i_0_58,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_T_out_2(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-txj4edo_/input.p',i_0_58) ).
cnf(i_0_62,plain,
( pred_attacker(tuple_T_in_1(X1))
| ~ pred_attacker(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-txj4edo_/input.p',i_0_62) ).
cnf(i_0_73,plain,
pred_attacker(name_new0x2Dname(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-txj4edo_/input.p',i_0_73) ).
cnf(i_0_56,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_T_out_4(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-txj4edo_/input.p',i_0_56) ).
cnf(i_0_76,negated_conjecture,
~ pred_attacker(name_objective),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-txj4edo_/input.p',i_0_76) ).
cnf(c_0_88,plain,
constr_xor(X1,constr_ZERO) = X1,
i_0_47 ).
cnf(c_0_89,plain,
constr_xor(X1,X2) = constr_xor(X2,X1),
i_0_48 ).
cnf(c_0_90,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_1(X1))
| ~ pred_attacker(tuple_T_in_3(X2,constr_h(constr_xor(X2,constr_xor(name_k0x30,name_ki))))) ),
i_0_75 ).
cnf(c_0_91,plain,
( pred_attacker(tuple_T_in_3(X1,X2))
| ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
i_0_59 ).
cnf(c_0_92,plain,
( pred_attacker(tuple_T_out_2(constr_h(constr_xor(X1,constr_xor(name_k0x30,name_ki)))))
| ~ pred_attacker(tuple_T_in_1(X1)) ),
i_0_74 ).
cnf(c_0_93,plain,
constr_xor(constr_ZERO,X1) = X1,
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_94,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(constr_h(constr_xor(X1,constr_xor(name_k0x30,name_ki))))
| ~ pred_attacker(tuple_T_in_1(X2))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_95,plain,
pred_attacker(constr_ZERO),
i_0_54 ).
cnf(c_0_96,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_T_out_2(X1)) ),
i_0_58 ).
cnf(c_0_97,plain,
( pred_attacker(tuple_T_out_2(constr_h(constr_xor(name_k0x30,name_ki))))
| ~ pred_attacker(tuple_T_in_1(constr_ZERO)) ),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_98,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(constr_h(constr_xor(name_k0x30,name_ki)))
| ~ pred_attacker(tuple_T_in_1(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_93]),c_0_95])]) ).
cnf(c_0_99,plain,
( pred_attacker(constr_h(constr_xor(name_k0x30,name_ki)))
| ~ pred_attacker(tuple_T_in_1(constr_ZERO)) ),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_100,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_1(constr_ZERO))
| ~ pred_attacker(tuple_T_in_1(X1)) ),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_101,plain,
( pred_attacker(tuple_T_in_1(X1))
| ~ pred_attacker(X1) ),
i_0_62 ).
cnf(c_0_102,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_1(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_95])]) ).
cnf(c_0_103,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_102,c_0_101]) ).
cnf(c_0_104,plain,
pred_attacker(name_new0x2Dname(X1)),
i_0_73 ).
cnf(c_0_105,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_T_out_4(X1)) ),
i_0_56 ).
cnf(c_0_106,plain,
pred_attacker(tuple_T_out_4(name_objective)),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_107,negated_conjecture,
~ pred_attacker(name_objective),
i_0_76 ).
cnf(c_0_108,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_107]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWW950+1 : TPTP v8.1.0. Released v7.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n019.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 : Sat Jun 4 14:21:42 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 9.28/2.42 # ENIGMATIC: Solved by autoschedule:
% 9.28/2.42 # No SInE strategy applied
% 9.28/2.42 # Trying AutoSched0 for 150 seconds
% 9.28/2.42 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 9.28/2.42 # and selection function SelectComplexExceptUniqMaxHorn.
% 9.28/2.42 #
% 9.28/2.42 # Preprocessing time : 0.019 s
% 9.28/2.42 # Presaturation interreduction done
% 9.28/2.42
% 9.28/2.42 # Proof found!
% 9.28/2.42 # SZS status Theorem
% 9.28/2.42 # SZS output start CNFRefutation
% See solution above
% 9.28/2.42 # Training examples: 0 positive, 0 negative
% 9.28/2.42
% 9.28/2.42 # -------------------------------------------------
% 9.28/2.42 # User time : 0.027 s
% 9.28/2.42 # System time : 0.005 s
% 9.28/2.42 # Total time : 0.032 s
% 9.28/2.42 # Maximum resident set size: 7120 pages
% 9.28/2.42
%------------------------------------------------------------------------------