TSTP Solution File: SWW956+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWW956+1 : TPTP v8.2.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : 300s
% DateTime : Tue May 21 06:46:56 EDT 2024
% Result : Theorem 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 36 ( 15 unt; 0 def)
% Number of atoms : 61 ( 3 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 48 ( 23 ~; 18 |; 1 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 34 ( 1 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax62,axiom,
! [X13,X14] :
( ( pred_attacker(X13)
& pred_attacker(X14) )
=> pred_attacker(constr_dec(X13,X14)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax62) ).
fof(ax55,axiom,
! [X1,X2] : constr_dec(constr_enc(X2,X1),X1) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax55) ).
fof(ax76,axiom,
! [X26] :
( pred_attacker(tuple_A_out_4(X26))
=> pred_attacker(X26) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax76) ).
fof(ax91,axiom,
! [X43] :
( pred_attacker(tuple_A_in_3(X43))
=> pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(X43,name_Na),name_P_7)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax91) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
fof(ax78,axiom,
! [X28] :
( pred_attacker(tuple_A_out_2(X28))
=> pred_attacker(X28) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax78) ).
fof(ax90,axiom,
pred_attacker(tuple_A_out_2(constr_mod(constr_exp(name_G_8,name_Na),name_P_7))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax90) ).
fof(ax81,axiom,
! [X33,X34] :
( pred_attacker(tuple_A_out_1(X33,X34))
=> pred_attacker(X34) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax81) ).
fof(ax82,axiom,
! [X35] :
( pred_attacker(X35)
=> pred_attacker(tuple_A_in_3(X35)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax82) ).
fof(ax89,axiom,
pred_attacker(tuple_A_out_1(name_P_7,name_G_8)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax89) ).
fof(c_0_10,plain,
! [X85,X86] :
( ~ pred_attacker(X85)
| ~ pred_attacker(X86)
| pred_attacker(constr_dec(X85,X86)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax62])])]) ).
fof(c_0_11,plain,
! [X53,X54] : constr_dec(constr_enc(X54,X53),X53) = X54,
inference(variable_rename,[status(thm)],[ax55]) ).
fof(c_0_12,plain,
! [X52] :
( ~ pred_attacker(tuple_A_out_4(X52))
| pred_attacker(X52) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax76])])]) ).
fof(c_0_13,plain,
! [X47] :
( ~ pred_attacker(tuple_A_in_3(X47))
| pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(X47,name_Na),name_P_7)))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax91])])]) ).
fof(c_0_14,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co0])]) ).
cnf(c_0_15,plain,
( pred_attacker(constr_dec(X1,X2))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
constr_dec(constr_enc(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_A_out_4(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(X1,name_Na),name_P_7))))
| ~ pred_attacker(tuple_A_in_3(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_nnf,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X74] :
( ~ pred_attacker(tuple_A_out_2(X74))
| pred_attacker(X74) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])])]) ).
cnf(c_0_21,plain,
( pred_attacker(X1)
| ~ pred_attacker(constr_enc(X1,X2))
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( pred_attacker(constr_enc(name_objective,constr_mod(constr_exp(X1,name_Na),name_P_7)))
| ~ pred_attacker(tuple_A_in_3(X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_A_out_2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
pred_attacker(tuple_A_out_2(constr_mod(constr_exp(name_G_8,name_Na),name_P_7))),
inference(split_conjunct,[status(thm)],[ax90]) ).
fof(c_0_26,plain,
! [X71,X72] :
( ~ pred_attacker(tuple_A_out_1(X71,X72))
| pred_attacker(X72) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_27,plain,
( ~ pred_attacker(constr_mod(constr_exp(X1,name_Na),name_P_7))
| ~ pred_attacker(tuple_A_in_3(X1)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_28,plain,
pred_attacker(constr_mod(constr_exp(name_G_8,name_Na),name_P_7)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_29,plain,
! [X65] :
( ~ pred_attacker(X65)
| pred_attacker(tuple_A_in_3(X65)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).
cnf(c_0_30,plain,
( pred_attacker(X2)
| ~ pred_attacker(tuple_A_out_1(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
pred_attacker(tuple_A_out_1(name_P_7,name_G_8)),
inference(split_conjunct,[status(thm)],[ax89]) ).
cnf(c_0_32,plain,
~ pred_attacker(tuple_A_in_3(name_G_8)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( pred_attacker(tuple_A_in_3(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,plain,
pred_attacker(name_G_8),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : SWW956+1 : TPTP v8.2.0. Released v7.4.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n025.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Sat May 18 19:07:38 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.44 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.45 # Version: 3.1.0
% 0.16/0.45 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # sh5l with pid 16026 completed with status 0
% 0.16/0.45 # Result found by sh5l
% 0.16/0.45 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.45 # Search class: FHUSS-FFMM21-MFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.45 # SAT001_MinMin_p005000_rr_RG with pid 16029 completed with status 0
% 0.16/0.45 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.45 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.45 # Search class: FHUSS-FFMM21-MFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.45 # Preprocessing time : 0.002 s
% 0.16/0.45 # Presaturation interreduction done
% 0.16/0.45
% 0.16/0.45 # Proof found!
% 0.16/0.45 # SZS status Theorem
% 0.16/0.45 # SZS output start CNFRefutation
% See solution above
% 0.16/0.45 # Parsed axioms : 94
% 0.16/0.45 # Removed by relevancy pruning/SinE : 6
% 0.16/0.45 # Initial clauses : 88
% 0.16/0.45 # Removed in clause preprocessing : 0
% 0.16/0.45 # Initial clauses in saturation : 88
% 0.16/0.45 # Processed clauses : 184
% 0.16/0.45 # ...of these trivial : 0
% 0.16/0.45 # ...subsumed : 0
% 0.16/0.45 # ...remaining for further processing : 184
% 0.16/0.45 # Other redundant clauses eliminated : 0
% 0.16/0.45 # Clauses deleted for lack of memory : 0
% 0.16/0.45 # Backward-subsumed : 1
% 0.16/0.45 # Backward-rewritten : 0
% 0.16/0.45 # Generated clauses : 52
% 0.16/0.45 # ...of the previous two non-redundant : 41
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 0
% 0.16/0.45 # Paramodulations : 52
% 0.16/0.45 # Factorizations : 0
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 0
% 0.16/0.45 # Disequality decompositions : 0
% 0.16/0.45 # Total rewrite steps : 2
% 0.16/0.45 # ...of those cached : 0
% 0.16/0.45 # Propositional unsat checks : 0
% 0.16/0.45 # Propositional check models : 0
% 0.16/0.45 # Propositional check unsatisfiable : 0
% 0.16/0.45 # Propositional clauses : 0
% 0.16/0.45 # Propositional clauses after purity: 0
% 0.16/0.45 # Propositional unsat core size : 0
% 0.16/0.45 # Propositional preprocessing time : 0.000
% 0.16/0.45 # Propositional encoding time : 0.000
% 0.16/0.45 # Propositional solver time : 0.000
% 0.16/0.45 # Success case prop preproc time : 0.000
% 0.16/0.45 # Success case prop encoding time : 0.000
% 0.16/0.45 # Success case prop solver time : 0.000
% 0.16/0.45 # Current number of processed clauses : 95
% 0.16/0.45 # Positive orientable unit clauses : 12
% 0.16/0.45 # Positive unorientable unit clauses: 1
% 0.16/0.45 # Negative unit clauses : 57
% 0.16/0.45 # Non-unit-clauses : 25
% 0.16/0.45 # Current number of unprocessed clauses: 33
% 0.16/0.45 # ...number of literals in the above : 87
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 89
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 421
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 418
% 0.16/0.45 # Non-unit clause-clause subsumptions : 1
% 0.16/0.45 # Unit Clause-clause subsumption calls : 443
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 0
% 0.16/0.45 # BW rewrite match successes : 0
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 3620
% 0.16/0.45 # Search garbage collected termcells : 533
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.010 s
% 0.16/0.45 # System time : 0.000 s
% 0.16/0.45 # Total time : 0.010 s
% 0.16/0.45 # Maximum resident set size: 1884 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.010 s
% 0.16/0.45 # System time : 0.003 s
% 0.16/0.45 # Total time : 0.013 s
% 0.16/0.45 # Maximum resident set size: 1776 pages
% 0.16/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------