TSTP Solution File: SWW967+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWW967+1 : TPTP v8.1.2. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:12:04 EDT 2023
% Result : Theorem 0.16s 0.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 38 ( 12 unt; 0 def)
% Number of atoms : 91 ( 0 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 94 ( 41 ~; 39 |; 7 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 4 con; 0-3 aty)
% Number of variables : 60 ( 17 sgn; 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax171,axiom,
! [X207,X208,X209,X210,X211] :
( ( pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X210,X209,X207)),constr_cbc_dec_1(X211,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X208,name_Kas))))
& pred_attacker(tuple_client_A_in_8(X211))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X208,name_Kas)))
& pred_attacker(tuple_client_A_in_6(X208))
& pred_attacker(tuple_client_A_in_4(X210))
& pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X209,name_Kas)))
& pred_eq_bitstring_bitstring(name_Na(X207),constr_tuple_4_get_0x30(constr_cbc_dec_4(X209,name_Kas)))
& pred_attacker(tuple_client_A_in_2(X209)) )
=> pred_attacker(tuple_client_A_out_9(name_objective)) ),
file('/export/starexec/sandbox/tmp/tmp.PMi4lgCVcp/E---3.1_13466.p',ax171) ).
fof(ax83,axiom,
! [X63,X64] : pred_eq_bitstring_bitstring(X63,X64),
file('/export/starexec/sandbox/tmp/tmp.PMi4lgCVcp/E---3.1_13466.p',ax83) ).
fof(ax120,axiom,
! [X117] :
( pred_attacker(X117)
=> pred_attacker(tuple_client_A_in_8(X117)) ),
file('/export/starexec/sandbox/tmp/tmp.PMi4lgCVcp/E---3.1_13466.p',ax120) ).
fof(ax122,axiom,
! [X119] :
( pred_attacker(X119)
=> pred_attacker(tuple_client_A_in_6(X119)) ),
file('/export/starexec/sandbox/tmp/tmp.PMi4lgCVcp/E---3.1_13466.p',ax122) ).
fof(ax124,axiom,
! [X121] :
( pred_attacker(X121)
=> pred_attacker(tuple_client_A_in_4(X121)) ),
file('/export/starexec/sandbox/tmp/tmp.PMi4lgCVcp/E---3.1_13466.p',ax124) ).
fof(ax126,axiom,
! [X123] :
( pred_attacker(X123)
=> pred_attacker(tuple_client_A_in_2(X123)) ),
file('/export/starexec/sandbox/tmp/tmp.PMi4lgCVcp/E---3.1_13466.p',ax126) ).
fof(ax119,axiom,
! [X114,X115,X116] :
( pred_attacker(tuple_client_A_out_1(X114,X115,X116))
=> pred_attacker(X116) ),
file('/export/starexec/sandbox/tmp/tmp.PMi4lgCVcp/E---3.1_13466.p',ax119) ).
fof(ax167,axiom,
! [X197] : pred_attacker(tuple_client_A_out_1(name_A,name_B,name_Na(X197))),
file('/export/starexec/sandbox/tmp/tmp.PMi4lgCVcp/E---3.1_13466.p',ax167) ).
fof(ax109,axiom,
! [X98] :
( pred_attacker(tuple_client_A_out_9(X98))
=> pred_attacker(X98) ),
file('/export/starexec/sandbox/tmp/tmp.PMi4lgCVcp/E---3.1_13466.p',ax109) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/tmp/tmp.PMi4lgCVcp/E---3.1_13466.p',co0) ).
fof(c_0_10,plain,
! [X240,X241,X242,X243,X244] :
( ~ pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X243,X242,X240)),constr_cbc_dec_1(X244,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X241,name_Kas))))
| ~ pred_attacker(tuple_client_A_in_8(X244))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X241,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_6(X241))
| ~ pred_attacker(tuple_client_A_in_4(X243))
| ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X242,name_Kas)))
| ~ pred_eq_bitstring_bitstring(name_Na(X240),constr_tuple_4_get_0x30(constr_cbc_dec_4(X242,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_2(X242))
| pred_attacker(tuple_client_A_out_9(name_objective)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax171])]) ).
fof(c_0_11,plain,
! [X261,X262] : pred_eq_bitstring_bitstring(X261,X262),
inference(variable_rename,[status(thm)],[ax83]) ).
cnf(c_0_12,plain,
( pred_attacker(tuple_client_A_out_9(name_objective))
| ~ pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X1,X2,X3)),constr_cbc_dec_1(X4,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X5,name_Kas))))
| ~ pred_attacker(tuple_client_A_in_8(X4))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X5,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_6(X5))
| ~ pred_attacker(tuple_client_A_in_4(X1))
| ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X2,name_Kas)))
| ~ pred_eq_bitstring_bitstring(name_Na(X3),constr_tuple_4_get_0x30(constr_cbc_dec_4(X2,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_2(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
pred_eq_bitstring_bitstring(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X321] :
( ~ pred_attacker(X321)
| pred_attacker(tuple_client_A_in_8(X321)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax120])]) ).
cnf(c_0_15,plain,
( pred_attacker(tuple_client_A_out_9(name_objective))
| ~ pred_attacker(tuple_client_A_in_8(X1))
| ~ pred_attacker(tuple_client_A_in_6(X2))
| ~ pred_attacker(tuple_client_A_in_4(X3))
| ~ pred_attacker(tuple_client_A_in_2(X4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13]),c_0_13]),c_0_13])]) ).
cnf(c_0_16,plain,
( pred_attacker(tuple_client_A_in_8(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X314] :
( ~ pred_attacker(X314)
| pred_attacker(tuple_client_A_in_6(X314)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax122])]) ).
cnf(c_0_18,plain,
( pred_attacker(tuple_client_A_out_9(name_objective))
| ~ pred_attacker(tuple_client_A_in_6(X1))
| ~ pred_attacker(tuple_client_A_in_4(X2))
| ~ pred_attacker(tuple_client_A_in_2(X3)) ),
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16])]) ).
cnf(c_0_19,plain,
( pred_attacker(tuple_client_A_in_6(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_20,plain,
! [X300] :
( ~ pred_attacker(X300)
| pred_attacker(tuple_client_A_in_4(X300)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax124])]) ).
cnf(c_0_21,plain,
( pred_attacker(tuple_client_A_out_9(name_objective))
| ~ pred_attacker(tuple_client_A_in_4(X1))
| ~ pred_attacker(tuple_client_A_in_2(X2)) ),
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_22,plain,
( pred_attacker(tuple_client_A_in_4(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_23,plain,
! [X259] :
( ~ pred_attacker(X259)
| pred_attacker(tuple_client_A_in_2(X259)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax126])]) ).
fof(c_0_24,plain,
! [X228,X229,X230] :
( ~ pred_attacker(tuple_client_A_out_1(X228,X229,X230))
| pred_attacker(X230) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax119])]) ).
fof(c_0_25,plain,
! [X218] : pred_attacker(tuple_client_A_out_1(name_A,name_B,name_Na(X218))),
inference(variable_rename,[status(thm)],[ax167]) ).
cnf(c_0_26,plain,
( pred_attacker(tuple_client_A_out_9(name_objective))
| ~ pred_attacker(tuple_client_A_in_2(X1)) ),
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_27,plain,
( pred_attacker(tuple_client_A_in_2(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
( pred_attacker(X3)
| ~ pred_attacker(tuple_client_A_out_1(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
pred_attacker(tuple_client_A_out_1(name_A,name_B,name_Na(X1))),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_30,plain,
! [X320] :
( ~ pred_attacker(tuple_client_A_out_9(X320))
| pred_attacker(X320) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax109])]) ).
cnf(c_0_31,plain,
( pred_attacker(tuple_client_A_out_9(name_objective))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
pred_attacker(name_Na(X1)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
fof(c_0_33,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co0])]) ).
cnf(c_0_34,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_client_A_out_9(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,plain,
pred_attacker(tuple_client_A_out_9(name_objective)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_37,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SWW967+1 : TPTP v8.1.2. Released v7.4.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n020.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 22:23:31 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.44 Running first-order model finding
% 0.16/0.44 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.PMi4lgCVcp/E---3.1_13466.p
% 0.16/0.47 # Version: 3.1pre001
% 0.16/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # sh5l with pid 13547 completed with status 0
% 0.16/0.47 # Result found by sh5l
% 0.16/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.47 # Search class: FHUSM-FFMM31-DFFFFFNN
% 0.16/0.47 # partial match(1): FHUSM-FFMM21-DFFFFFNN
% 0.16/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47 # Starting new_ho_10 with 55s (1) cores
% 0.16/0.47 # new_ho_10 with pid 13550 completed with status 0
% 0.16/0.47 # Result found by new_ho_10
% 0.16/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.47 # Search class: FHUSM-FFMM31-DFFFFFNN
% 0.16/0.47 # partial match(1): FHUSM-FFMM21-DFFFFFNN
% 0.16/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47 # Starting new_ho_10 with 55s (1) cores
% 0.16/0.47 # Preprocessing time : 0.004 s
% 0.16/0.47 # Presaturation interreduction done
% 0.16/0.47
% 0.16/0.47 # Proof found!
% 0.16/0.47 # SZS status Theorem
% 0.16/0.47 # SZS output start CNFRefutation
% See solution above
% 0.16/0.47 # Parsed axioms : 175
% 0.16/0.47 # Removed by relevancy pruning/SinE : 48
% 0.16/0.47 # Initial clauses : 127
% 0.16/0.47 # Removed in clause preprocessing : 0
% 0.16/0.47 # Initial clauses in saturation : 127
% 0.16/0.47 # Processed clauses : 277
% 0.16/0.47 # ...of these trivial : 0
% 0.16/0.47 # ...subsumed : 0
% 0.16/0.47 # ...remaining for further processing : 277
% 0.16/0.47 # Other redundant clauses eliminated : 0
% 0.16/0.47 # Clauses deleted for lack of memory : 0
% 0.16/0.47 # Backward-subsumed : 4
% 0.16/0.47 # Backward-rewritten : 1
% 0.16/0.47 # Generated clauses : 83
% 0.16/0.47 # ...of the previous two non-redundant : 67
% 0.16/0.47 # ...aggressively subsumed : 0
% 0.16/0.47 # Contextual simplify-reflections : 0
% 0.16/0.47 # Paramodulations : 83
% 0.16/0.47 # Factorizations : 0
% 0.16/0.47 # NegExts : 0
% 0.16/0.47 # Equation resolutions : 0
% 0.16/0.47 # Total rewrite steps : 24
% 0.16/0.47 # Propositional unsat checks : 0
% 0.16/0.47 # Propositional check models : 0
% 0.16/0.47 # Propositional check unsatisfiable : 0
% 0.16/0.47 # Propositional clauses : 0
% 0.16/0.47 # Propositional clauses after purity: 0
% 0.16/0.47 # Propositional unsat core size : 0
% 0.16/0.47 # Propositional preprocessing time : 0.000
% 0.16/0.47 # Propositional encoding time : 0.000
% 0.16/0.47 # Propositional solver time : 0.000
% 0.16/0.47 # Success case prop preproc time : 0.000
% 0.16/0.47 # Success case prop encoding time : 0.000
% 0.16/0.47 # Success case prop solver time : 0.000
% 0.16/0.47 # Current number of processed clauses : 145
% 0.16/0.47 # Positive orientable unit clauses : 25
% 0.16/0.47 # Positive unorientable unit clauses: 0
% 0.16/0.47 # Negative unit clauses : 67
% 0.16/0.47 # Non-unit-clauses : 53
% 0.16/0.47 # Current number of unprocessed clauses: 44
% 0.16/0.47 # ...number of literals in the above : 100
% 0.16/0.47 # Current number of archived formulas : 0
% 0.16/0.47 # Current number of archived clauses : 132
% 0.16/0.47 # Clause-clause subsumption calls (NU) : 2885
% 0.16/0.47 # Rec. Clause-clause subsumption calls : 2391
% 0.16/0.47 # Non-unit clause-clause subsumptions : 7
% 0.16/0.47 # Unit Clause-clause subsumption calls : 1127
% 0.16/0.47 # Rewrite failures with RHS unbound : 0
% 0.16/0.47 # BW rewrite match attempts : 1
% 0.16/0.47 # BW rewrite match successes : 1
% 0.16/0.47 # Condensation attempts : 277
% 0.16/0.47 # Condensation successes : 3
% 0.16/0.47 # Termbank termtop insertions : 6304
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.011 s
% 0.16/0.47 # System time : 0.006 s
% 0.16/0.47 # Total time : 0.016 s
% 0.16/0.47 # Maximum resident set size: 2304 pages
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.014 s
% 0.16/0.47 # System time : 0.008 s
% 0.16/0.47 # Total time : 0.022 s
% 0.16/0.47 # Maximum resident set size: 1952 pages
% 0.16/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------