TSTP Solution File: SWW959+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWW959+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:11 EDT 2022
% Result : Theorem 8.83s 2.56s
% Output : CNFRefutation 8.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of formulae : 27 ( 8 unt; 0 def)
% Number of atoms : 56 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 63 ( 34 ~; 26 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 4 prp; 0-1 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 29 ( 18 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_166,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-fb2v4y86/input.p',i_0_166) ).
cnf(i_0_120,plain,
( pred_attacker(tuple_client_B_in_5(X1))
| ~ pred_attacker(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fb2v4y86/input.p',i_0_120) ).
cnf(i_0_122,plain,
( pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_attacker(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fb2v4y86/input.p',i_0_122) ).
cnf(i_0_124,plain,
( pred_attacker(tuple_client_B_in_2(X1))
| ~ pred_attacker(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fb2v4y86/input.p',i_0_124) ).
cnf(i_0_161,plain,
pred_attacker(tuple_client_A_out_1(name_A,name_I)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fb2v4y86/input.p',i_0_161) ).
cnf(i_0_114,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_client_B_out_6(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fb2v4y86/input.p',i_0_114) ).
cnf(i_0_169,negated_conjecture,
~ pred_attacker(name_objective),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fb2v4y86/input.p',i_0_169) ).
cnf(c_0_177,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_166 ).
cnf(c_0_178,plain,
( pred_attacker(tuple_client_B_in_5(X1))
| ~ pred_attacker(X1) ),
i_0_120 ).
cnf(c_0_179,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_177,c_0_178]) ).
cnf(c_0_180,plain,
( pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_attacker(X1) ),
i_0_122 ).
fof(c_0_181,plain,
( ~ epred3_0
<=> ! [X3] : ~ pred_attacker(X3) ),
introduced(definition) ).
fof(c_0_182,plain,
( ~ epred2_0
<=> ! [X2] : ~ pred_attacker(X2) ),
introduced(definition) ).
fof(c_0_183,plain,
( ~ epred1_0
<=> ! [X1] : ~ pred_attacker(X1) ),
introduced(definition) ).
cnf(c_0_184,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_179,c_0_180]) ).
cnf(c_0_185,plain,
( pred_attacker(tuple_client_B_in_2(X1))
| ~ pred_attacker(X1) ),
i_0_124 ).
cnf(c_0_186,plain,
( epred3_0
| ~ pred_attacker(X1) ),
inference(split_equiv,[status(thm)],[c_0_181]) ).
cnf(c_0_187,plain,
pred_attacker(tuple_client_A_out_1(name_A,name_I)),
i_0_161 ).
cnf(c_0_188,plain,
( epred2_0
| ~ pred_attacker(X1) ),
inference(split_equiv,[status(thm)],[c_0_182]) ).
cnf(c_0_189,plain,
( epred1_0
| ~ pred_attacker(X1) ),
inference(split_equiv,[status(thm)],[c_0_183]) ).
cnf(c_0_190,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_client_B_out_6(X1)) ),
i_0_114 ).
cnf(c_0_191,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_184,c_0_185]) ).
cnf(c_0_192,negated_conjecture,
~ pred_attacker(name_objective),
i_0_169 ).
cnf(c_0_193,plain,
epred3_0,
inference(spm,[status(thm)],[c_0_186,c_0_187]) ).
cnf(c_0_194,plain,
epred2_0,
inference(spm,[status(thm)],[c_0_188,c_0_187]) ).
cnf(c_0_195,plain,
epred1_0,
inference(spm,[status(thm)],[c_0_189,c_0_187]) ).
cnf(c_0_196,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_190,c_0_191]),c_0_192]),c_0_183]),c_0_182]),c_0_181]),c_0_193]),c_0_194]),c_0_195])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWW959+1 : TPTP v8.1.0. Released v7.4.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n026.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 5 15:46:16 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 8.83/2.56 # ENIGMATIC: Solved by autoschedule:
% 8.83/2.56 # No SInE strategy applied
% 8.83/2.56 # Trying AutoSched0 for 150 seconds
% 8.83/2.56 # AutoSched0-Mode selected heuristic G_E___024_B31_F1_PI_AE_Q4_CS_SP_S2S
% 8.83/2.56 # and selection function SelectNewComplexAHP.
% 8.83/2.56 #
% 8.83/2.56 # Preprocessing time : 0.025 s
% 8.83/2.56
% 8.83/2.56 # Proof found!
% 8.83/2.56 # SZS status Theorem
% 8.83/2.56 # SZS output start CNFRefutation
% See solution above
% 8.83/2.56 # Training examples: 0 positive, 0 negative
% 8.83/2.56
% 8.83/2.56 # -------------------------------------------------
% 8.83/2.56 # User time : 0.038 s
% 8.83/2.56 # System time : 0.005 s
% 8.83/2.56 # Total time : 0.043 s
% 8.83/2.56 # Maximum resident set size: 7116 pages
% 8.83/2.56
%------------------------------------------------------------------------------