TSTP Solution File: SWW955+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWW955+1 : TPTP v8.1.2. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 300s
% DateTime : Sat May 4 10:04:39 EDT 2024
% Result : Theorem 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 43 ( 17 unt; 0 def)
% Number of atoms : 73 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 55 ( 25 ~; 22 |; 1 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-2 aty)
% Number of variables : 42 ( 2 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax67,axiom,
! [X22] :
( pred_attacker(tuple_A_out_3(X22))
=> pred_attacker(X22) ),
file('/export/starexec/sandbox/tmp/tmp.OUlw2j0RCP/E---3.1_4291.p',ax67) ).
fof(ax78,axiom,
! [X33] :
( pred_attacker(tuple_A_in_2(X33))
=> pred_attacker(tuple_A_out_3(constr_comm_dec(X33,name_Ka))) ),
file('/export/starexec/sandbox/tmp/tmp.OUlw2j0RCP/E---3.1_4291.p',ax78) ).
fof(ax79,axiom,
! [X34] :
( pred_attacker(tuple_A_in_2(X34))
=> pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))) ),
file('/export/starexec/sandbox/tmp/tmp.OUlw2j0RCP/E---3.1_4291.p',ax79) ).
fof(ax70,axiom,
! [X25] :
( pred_attacker(X25)
=> pred_attacker(tuple_A_in_2(X25)) ),
file('/export/starexec/sandbox/tmp/tmp.OUlw2j0RCP/E---3.1_4291.p',ax70) ).
fof(ax46,axiom,
! [X3,X4] : constr_comm_dec(constr_comm_enc(X4,X3),X3) = X4,
file('/export/starexec/sandbox/tmp/tmp.OUlw2j0RCP/E---3.1_4291.p',ax46) ).
fof(ax69,axiom,
! [X24] :
( pred_attacker(tuple_A_out_1(X24))
=> pred_attacker(X24) ),
file('/export/starexec/sandbox/tmp/tmp.OUlw2j0RCP/E---3.1_4291.p',ax69) ).
fof(ax50,axiom,
! [X7,X8] :
( ( pred_attacker(X7)
& pred_attacker(X8) )
=> pred_attacker(constr_dec(X7,X8)) ),
file('/export/starexec/sandbox/tmp/tmp.OUlw2j0RCP/E---3.1_4291.p',ax50) ).
fof(ax45,axiom,
! [X1,X2] : constr_dec(constr_enc(X2,X1),X1) = X2,
file('/export/starexec/sandbox/tmp/tmp.OUlw2j0RCP/E---3.1_4291.p',ax45) ).
fof(ax65,axiom,
! [X20] :
( pred_attacker(tuple_A_out_4(X20))
=> pred_attacker(X20) ),
file('/export/starexec/sandbox/tmp/tmp.OUlw2j0RCP/E---3.1_4291.p',ax65) ).
fof(ax77,axiom,
pred_attacker(tuple_A_out_1(constr_comm_enc(name_m_9,name_Ka))),
file('/export/starexec/sandbox/tmp/tmp.OUlw2j0RCP/E---3.1_4291.p',ax77) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/tmp/tmp.OUlw2j0RCP/E---3.1_4291.p',co0) ).
fof(c_0_11,plain,
! [X54] :
( ~ pred_attacker(tuple_A_out_3(X54))
| pred_attacker(X54) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax67])])]) ).
fof(c_0_12,plain,
! [X37] :
( ~ pred_attacker(tuple_A_in_2(X37))
| pred_attacker(tuple_A_out_3(constr_comm_dec(X37,name_Ka))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])])]) ).
fof(c_0_13,plain,
! [X36] :
( ~ pred_attacker(tuple_A_in_2(X36))
| pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax79])])]) ).
fof(c_0_14,plain,
! [X45] :
( ~ pred_attacker(X45)
| pred_attacker(tuple_A_in_2(X45)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax70])])]) ).
cnf(c_0_15,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_A_out_3(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( pred_attacker(tuple_A_out_3(constr_comm_dec(X1,name_Ka)))
| ~ pred_attacker(tuple_A_in_2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X49,X50] : constr_comm_dec(constr_comm_enc(X50,X49),X49) = X50,
inference(variable_rename,[status(thm)],[ax46]) ).
cnf(c_0_18,plain,
( pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9)))
| ~ pred_attacker(tuple_A_in_2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( pred_attacker(tuple_A_in_2(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( pred_attacker(constr_comm_dec(X1,name_Ka))
| ~ pred_attacker(tuple_A_in_2(X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
constr_comm_dec(constr_comm_enc(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_22,plain,
! [X48] :
( ~ pred_attacker(tuple_A_out_1(X48))
| pred_attacker(X48) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax69])])]) ).
fof(c_0_23,plain,
! [X61,X62] :
( ~ pred_attacker(X61)
| ~ pred_attacker(X62)
| pred_attacker(constr_dec(X61,X62)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax50])])]) ).
fof(c_0_24,plain,
! [X41,X42] : constr_dec(constr_enc(X42,X41),X41) = X42,
inference(variable_rename,[status(thm)],[ax45]) ).
fof(c_0_25,plain,
! [X40] :
( ~ pred_attacker(tuple_A_out_4(X40))
| pred_attacker(X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax65])])]) ).
cnf(c_0_26,plain,
( pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9)))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,plain,
pred_attacker(tuple_A_out_1(constr_comm_enc(name_m_9,name_Ka))),
inference(split_conjunct,[status(thm)],[ax77]) ).
cnf(c_0_28,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_A_in_2(constr_comm_enc(X1,name_Ka))) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_A_out_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_30,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co0])]) ).
cnf(c_0_31,plain,
( pred_attacker(constr_dec(X1,X2))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
constr_dec(constr_enc(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_A_out_4(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,plain,
pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,plain,
( pred_attacker(X1)
| ~ pred_attacker(constr_comm_enc(X1,name_Ka)) ),
inference(spm,[status(thm)],[c_0_28,c_0_19]) ).
cnf(c_0_36,plain,
pred_attacker(constr_comm_enc(name_m_9,name_Ka)),
inference(spm,[status(thm)],[c_0_29,c_0_27]) ).
fof(c_0_37,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_nnf,[status(thm)],[c_0_30]) ).
cnf(c_0_38,plain,
( pred_attacker(X1)
| ~ pred_attacker(constr_enc(X1,X2))
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,plain,
pred_attacker(constr_enc(name_objective,name_m_9)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,plain,
pred_attacker(name_m_9),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW955+1 : TPTP v8.1.2. Released v7.4.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 13:18:29 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.OUlw2j0RCP/E---3.1_4291.p
% 0.21/0.52 # Version: 3.1.0
% 0.21/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # sh5l with pid 4390 completed with status 0
% 0.21/0.52 # Result found by sh5l
% 0.21/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52 # Search class: FHUSS-FFMM21-SFFFFFNN
% 0.21/0.52 # partial match(1): FHUSS-FFMM21-MFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.52 # SAT001_MinMin_p005000_rr_RG with pid 4393 completed with status 0
% 0.21/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52 # Search class: FHUSS-FFMM21-SFFFFFNN
% 0.21/0.52 # partial match(1): FHUSS-FFMM21-MFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.52 # Preprocessing time : 0.002 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Theorem
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 82
% 0.21/0.52 # Removed by relevancy pruning/SinE : 8
% 0.21/0.52 # Initial clauses : 74
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 74
% 0.21/0.52 # Processed clauses : 166
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 4
% 0.21/0.52 # ...remaining for further processing : 162
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 1
% 0.21/0.52 # Backward-rewritten : 2
% 0.21/0.52 # Generated clauses : 46
% 0.21/0.52 # ...of the previous two non-redundant : 36
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 0
% 0.21/0.52 # Paramodulations : 46
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 3
% 0.21/0.52 # ...of those cached : 1
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 85
% 0.21/0.52 # Positive orientable unit clauses : 13
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 46
% 0.21/0.52 # Non-unit-clauses : 26
% 0.21/0.52 # Current number of unprocessed clauses: 18
% 0.21/0.52 # ...number of literals in the above : 33
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 77
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 438
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 408
% 0.21/0.52 # Non-unit clause-clause subsumptions : 5
% 0.21/0.52 # Unit Clause-clause subsumption calls : 121
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 2
% 0.21/0.52 # BW rewrite match successes : 2
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 2864
% 0.21/0.52 # Search garbage collected termcells : 440
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.011 s
% 0.21/0.52 # System time : 0.005 s
% 0.21/0.52 # Total time : 0.016 s
% 0.21/0.52 # Maximum resident set size: 1904 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.014 s
% 0.21/0.52 # System time : 0.008 s
% 0.21/0.52 # Total time : 0.021 s
% 0.21/0.53 # Maximum resident set size: 1768 pages
% 0.21/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------