TSTP Solution File: SWW950+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWW950+1 : TPTP v8.1.2. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:01 EDT 2023
% Result : Theorem 0.17s 0.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 35 ( 8 unt; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 69 ( 31 ~; 29 |; 2 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 40 ( 10 sgn; 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax74,axiom,
! [X30,X31] :
( ( pred_attacker(tuple_T_in_3(X30,constr_h(constr_xor(X30,constr_xor(name_k0x30,name_ki)))))
& pred_attacker(tuple_T_in_1(X31)) )
=> pred_attacker(tuple_T_out_4(name_objective)) ),
file('/export/starexec/sandbox/tmp/tmp.SUIQ0cTc0o/E---3.1_14040.p',ax74) ).
fof(ax58,axiom,
! [X15,X16] :
( ( pred_attacker(X15)
& pred_attacker(X16) )
=> pred_attacker(tuple_T_in_3(X15,X16)) ),
file('/export/starexec/sandbox/tmp/tmp.SUIQ0cTc0o/E---3.1_14040.p',ax58) ).
fof(ax57,axiom,
! [X14] :
( pred_attacker(tuple_T_out_2(X14))
=> pred_attacker(X14) ),
file('/export/starexec/sandbox/tmp/tmp.SUIQ0cTc0o/E---3.1_14040.p',ax57) ).
fof(ax73,axiom,
! [X29] :
( pred_attacker(tuple_T_in_1(X29))
=> pred_attacker(tuple_T_out_2(constr_h(constr_xor(X29,constr_xor(name_k0x30,name_ki))))) ),
file('/export/starexec/sandbox/tmp/tmp.SUIQ0cTc0o/E---3.1_14040.p',ax73) ).
fof(ax62,axiom,
! [X22] :
( pred_attacker(tuple_T_in_1(X22))
=> pred_attacker(X22) ),
file('/export/starexec/sandbox/tmp/tmp.SUIQ0cTc0o/E---3.1_14040.p',ax62) ).
fof(ax61,axiom,
! [X21] :
( pred_attacker(X21)
=> pred_attacker(tuple_T_in_1(X21)) ),
file('/export/starexec/sandbox/tmp/tmp.SUIQ0cTc0o/E---3.1_14040.p',ax61) ).
fof(ax72,axiom,
! [X28] : pred_attacker(name_new0x2Dname(X28)),
file('/export/starexec/sandbox/tmp/tmp.SUIQ0cTc0o/E---3.1_14040.p',ax72) ).
fof(ax55,axiom,
! [X12] :
( pred_attacker(tuple_T_out_4(X12))
=> pred_attacker(X12) ),
file('/export/starexec/sandbox/tmp/tmp.SUIQ0cTc0o/E---3.1_14040.p',ax55) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/tmp/tmp.SUIQ0cTc0o/E---3.1_14040.p',co0) ).
fof(c_0_9,plain,
! [X61,X62] :
( ~ pred_attacker(tuple_T_in_3(X61,constr_h(constr_xor(X61,constr_xor(name_k0x30,name_ki)))))
| ~ pred_attacker(tuple_T_in_1(X62))
| pred_attacker(tuple_T_out_4(name_objective)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax74])]) ).
fof(c_0_10,plain,
! [X46,X47] :
( ~ pred_attacker(X46)
| ~ pred_attacker(X47)
| pred_attacker(tuple_T_in_3(X46,X47)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])]) ).
fof(c_0_11,plain,
! [X45] :
( ~ pred_attacker(tuple_T_out_2(X45))
| pred_attacker(X45) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).
fof(c_0_12,plain,
! [X60] :
( ~ pred_attacker(tuple_T_in_1(X60))
| pred_attacker(tuple_T_out_2(constr_h(constr_xor(X60,constr_xor(name_k0x30,name_ki))))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax73])]) ).
cnf(c_0_13,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_3(X1,constr_h(constr_xor(X1,constr_xor(name_k0x30,name_ki)))))
| ~ pred_attacker(tuple_T_in_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( pred_attacker(tuple_T_in_3(X1,X2))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_T_out_2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( pred_attacker(tuple_T_out_2(constr_h(constr_xor(X1,constr_xor(name_k0x30,name_ki)))))
| ~ pred_attacker(tuple_T_in_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X53] :
( ~ pred_attacker(tuple_T_in_1(X53))
| pred_attacker(X53) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax62])]) ).
cnf(c_0_18,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(constr_h(constr_xor(X1,constr_xor(name_k0x30,name_ki))))
| ~ pred_attacker(tuple_T_in_1(X2))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
( pred_attacker(constr_h(constr_xor(X1,constr_xor(name_k0x30,name_ki))))
| ~ pred_attacker(tuple_T_in_1(X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_T_in_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_21,plain,
! [X52] :
( ~ pred_attacker(X52)
| pred_attacker(tuple_T_in_1(X52)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax61])]) ).
cnf(c_0_22,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_1(X1))
| ~ pred_attacker(tuple_T_in_1(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_23,plain,
( pred_attacker(tuple_T_in_1(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_1(X1))
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_25,plain,
! [X59] : pred_attacker(name_new0x2Dname(X59)),
inference(variable_rename,[status(thm)],[ax72]) ).
cnf(c_0_26,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_27,plain,
pred_attacker(name_new0x2Dname(X1)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_28,plain,
! [X43] :
( ~ pred_attacker(tuple_T_out_4(X43))
| pred_attacker(X43) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).
cnf(c_0_29,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
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(X1)
| ~ pred_attacker(tuple_T_out_4(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,plain,
pred_attacker(tuple_T_out_4(name_objective)),
inference(spm,[status(thm)],[c_0_29,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SWW950+1 : TPTP v8.1.2. Released v7.4.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n004.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:07:00 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order model finding
% 0.17/0.43 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.SUIQ0cTc0o/E---3.1_14040.p
% 0.17/0.45 # Version: 3.1pre001
% 0.17/0.45 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45 # Starting sh5l with 300s (1) cores
% 0.17/0.45 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 14137 completed with status 0
% 0.17/0.45 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.17/0.45 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.45 # No SInE strategy applied
% 0.17/0.45 # Search class: FHUSM-FFMM21-MFFFFFNN
% 0.17/0.45 # partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.17/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.45 # Starting G-E--_100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y with 797s (1) cores
% 0.17/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.17/0.45 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 136s (1) cores
% 0.17/0.45 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.17/0.45 # Starting G-E--_200_C18_F1_AE_CS_SP_PI_S0Y with 136s (1) cores
% 0.17/0.45 # G-E--_200_C18_F1_AE_CS_SP_PI_S0Y with pid 14148 completed with status 0
% 0.17/0.45 # Result found by G-E--_200_C18_F1_AE_CS_SP_PI_S0Y
% 0.17/0.45 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.45 # No SInE strategy applied
% 0.17/0.45 # Search class: FHUSM-FFMM21-MFFFFFNN
% 0.17/0.45 # partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.17/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.45 # Starting G-E--_100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y with 797s (1) cores
% 0.17/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.17/0.45 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 136s (1) cores
% 0.17/0.45 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.17/0.45 # Starting G-E--_200_C18_F1_AE_CS_SP_PI_S0Y with 136s (1) cores
% 0.17/0.45 # Preprocessing time : 0.002 s
% 0.17/0.45
% 0.17/0.45 # Proof found!
% 0.17/0.45 # SZS status Theorem
% 0.17/0.45 # SZS output start CNFRefutation
% See solution above
% 0.17/0.45 # Parsed axioms : 76
% 0.17/0.45 # Removed by relevancy pruning/SinE : 0
% 0.17/0.45 # Initial clauses : 76
% 0.17/0.45 # Removed in clause preprocessing : 0
% 0.17/0.45 # Initial clauses in saturation : 76
% 0.17/0.45 # Processed clauses : 130
% 0.17/0.45 # ...of these trivial : 3
% 0.17/0.45 # ...subsumed : 17
% 0.17/0.45 # ...remaining for further processing : 110
% 0.17/0.45 # Other redundant clauses eliminated : 0
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 20
% 0.17/0.45 # Backward-rewritten : 1
% 0.17/0.45 # Generated clauses : 211
% 0.17/0.45 # ...of the previous two non-redundant : 173
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 3
% 0.17/0.45 # Paramodulations : 211
% 0.17/0.45 # Factorizations : 0
% 0.17/0.45 # NegExts : 0
% 0.17/0.45 # Equation resolutions : 0
% 0.17/0.45 # Total rewrite steps : 53
% 0.17/0.45 # Propositional unsat checks : 0
% 0.17/0.45 # Propositional check models : 0
% 0.17/0.45 # Propositional check unsatisfiable : 0
% 0.17/0.45 # Propositional clauses : 0
% 0.17/0.45 # Propositional clauses after purity: 0
% 0.17/0.45 # Propositional unsat core size : 0
% 0.17/0.45 # Propositional preprocessing time : 0.000
% 0.17/0.45 # Propositional encoding time : 0.000
% 0.17/0.45 # Propositional solver time : 0.000
% 0.17/0.45 # Success case prop preproc time : 0.000
% 0.17/0.45 # Success case prop encoding time : 0.000
% 0.17/0.45 # Success case prop solver time : 0.000
% 0.17/0.45 # Current number of processed clauses : 89
% 0.17/0.45 # Positive orientable unit clauses : 18
% 0.17/0.45 # Positive unorientable unit clauses: 1
% 0.17/0.45 # Negative unit clauses : 49
% 0.17/0.45 # Non-unit-clauses : 21
% 0.17/0.45 # Current number of unprocessed clauses: 82
% 0.17/0.45 # ...number of literals in the above : 189
% 0.17/0.45 # Current number of archived formulas : 0
% 0.17/0.45 # Current number of archived clauses : 21
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 876
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 810
% 0.17/0.45 # Non-unit clause-clause subsumptions : 31
% 0.17/0.45 # Unit Clause-clause subsumption calls : 116
% 0.17/0.45 # Rewrite failures with RHS unbound : 0
% 0.17/0.45 # BW rewrite match attempts : 11
% 0.17/0.45 # BW rewrite match successes : 7
% 0.17/0.45 # Condensation attempts : 0
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 3821
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.009 s
% 0.17/0.45 # System time : 0.002 s
% 0.17/0.45 # Total time : 0.011 s
% 0.17/0.45 # Maximum resident set size: 1852 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.037 s
% 0.17/0.45 # System time : 0.012 s
% 0.17/0.45 # Total time : 0.050 s
% 0.17/0.45 # Maximum resident set size: 1740 pages
% 0.17/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------