TSTP Solution File: SWW965+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWW965+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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:12 EDT 2022
% Result : Theorem 8.66s 2.52s
% Output : CNFRefutation 8.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 21 ( 6 unt; 0 nHn; 21 RR)
% Number of literals : 47 ( 0 equ; 28 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_185,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_5(X1))
| ~ pred_attacker(tuple_client_B_in_3(X2))
| ~ pred_attacker(tuple_client_B_in_2(X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34nl54qc/input.p',i_0_185) ).
cnf(i_0_138,plain,
( pred_attacker(tuple_client_B_in_5(X1))
| ~ pred_attacker(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34nl54qc/input.p',i_0_138) ).
cnf(i_0_140,plain,
( pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_attacker(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34nl54qc/input.p',i_0_140) ).
cnf(i_0_142,plain,
( pred_attacker(tuple_client_B_in_2(X1))
| ~ pred_attacker(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34nl54qc/input.p',i_0_142) ).
cnf(i_0_180,plain,
pred_attacker(tuple_client_A_out_1(name_A,name_I)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34nl54qc/input.p',i_0_180) ).
cnf(i_0_132,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_client_B_out_6(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34nl54qc/input.p',i_0_132) ).
cnf(i_0_188,negated_conjecture,
~ pred_attacker(name_objective),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-34nl54qc/input.p',i_0_188) ).
cnf(c_0_196,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_5(X1))
| ~ pred_attacker(tuple_client_B_in_3(X2))
| ~ pred_attacker(tuple_client_B_in_2(X3)) ),
i_0_185 ).
cnf(c_0_197,plain,
( pred_attacker(tuple_client_B_in_5(X1))
| ~ pred_attacker(X1) ),
i_0_138 ).
cnf(c_0_198,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_attacker(tuple_client_B_in_2(X2))
| ~ pred_attacker(X3) ),
inference(spm,[status(thm)],[c_0_196,c_0_197]) ).
cnf(c_0_199,plain,
( pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_attacker(X1) ),
i_0_140 ).
cnf(c_0_200,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_2(X1))
| ~ pred_attacker(X2)
| ~ pred_attacker(X3) ),
inference(spm,[status(thm)],[c_0_198,c_0_199]) ).
cnf(c_0_201,plain,
( pred_attacker(tuple_client_B_in_2(X1))
| ~ pred_attacker(X1) ),
i_0_142 ).
cnf(c_0_202,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2)
| ~ pred_attacker(X3) ),
inference(spm,[status(thm)],[c_0_200,c_0_201]) ).
cnf(c_0_203,plain,
pred_attacker(tuple_client_A_out_1(name_A,name_I)),
i_0_180 ).
cnf(c_0_204,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_202,c_0_203]) ).
cnf(c_0_205,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_204,c_0_203]) ).
cnf(c_0_206,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_client_B_out_6(X1)) ),
i_0_132 ).
cnf(c_0_207,plain,
pred_attacker(tuple_client_B_out_6(name_objective)),
inference(spm,[status(thm)],[c_0_205,c_0_203]) ).
cnf(c_0_208,negated_conjecture,
~ pred_attacker(name_objective),
i_0_188 ).
cnf(c_0_209,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_206,c_0_207]),c_0_208]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWW965+1 : TPTP v8.1.0. Released v7.4.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n017.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 : Mon Jun 6 07:34:48 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 8.66/2.52 # ENIGMATIC: Solved by autoschedule:
% 8.66/2.52 # No SInE strategy applied
% 8.66/2.52 # Trying AutoSched0 for 150 seconds
% 8.66/2.52 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.66/2.52 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.66/2.52 #
% 8.66/2.52 # Preprocessing time : 0.031 s
% 8.66/2.52 # Presaturation interreduction done
% 8.66/2.52
% 8.66/2.52 # Proof found!
% 8.66/2.52 # SZS status Theorem
% 8.66/2.52 # SZS output start CNFRefutation
% See solution above
% 8.66/2.52 # Training examples: 0 positive, 0 negative
% 8.66/2.52
% 8.66/2.52 # -------------------------------------------------
% 8.66/2.52 # User time : 0.035 s
% 8.66/2.52 # System time : 0.011 s
% 8.66/2.52 # Total time : 0.046 s
% 8.66/2.52 # Maximum resident set size: 7120 pages
% 8.66/2.52
%------------------------------------------------------------------------------