%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN982-1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 03:31:01 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.44s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of clauses : 59 ( 17 unt; 0 nHn; 59 RR)
% Number of literals : 136 ( 0 equ; 81 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-1 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 99 ( 22 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause33,axiom,
( ~ ssBf(X2)
| ~ ssM(sent(X1,b,pair(X1,X2)))
| ssM(sent(b,t,triple(b,nb(X2),encr(triple(X1,X2,tb(X2)),bt)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause33) ).
cnf(clause34,axiom,
( ~ ssSb(pair(X1,X3))
| ~ ssM(sent(X1,b,pair(encr(triple(X1,X2,tb(X3)),bt),encr(nb(X3),X2))))
| ssBk(key(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause34) ).
cnf(clause27,axiom,
( ~ ssP(X3)
| ~ ssP(X2)
| ~ ssIm(X1)
| ssM(sent(X2,X3,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause27) ).
cnf(clause20,axiom,
( ~ ssM(sent(X1,X2,X3))
| ssIm(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause20) ).
cnf(clause16,axiom,
ssM(sent(a,b,pair(a,na))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause16) ).
cnf(clause3,axiom,
ssBf(na),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause3) ).
cnf(clause4,axiom,
ssP(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause4) ).
cnf(clause26,axiom,
( ~ ssIm(X2)
| ~ ssIm(X1)
| ssIm(pair(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause26) ).
cnf(clause17,axiom,
( ~ ssIm(triple(X1,X2,X3))
| ssIm(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause17) ).
cnf(clause30,axiom,
( ~ ssBf(X2)
| ~ ssM(sent(X1,b,pair(X1,X2)))
| ssSb(pair(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause30) ).
cnf(clause29,axiom,
( ~ ssP(X3)
| ~ ssIk(key(X2,X3))
| ~ ssIm(X1)
| ssIm(encr(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause29) ).
cnf(clause25,axiom,
( ~ ssP(X2)
| ~ ssIm(X1)
| ssIk(key(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause25) ).
cnf(clause18,axiom,
( ~ ssIm(triple(X1,X2,X3))
| ssIm(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause18) ).
cnf(clause14,axiom,
( ~ ssIm(pair(X1,X2))
| ssIm(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause14) ).
cnf(clause37,negated_conjecture,
( ~ ssBk(key(X1,a))
| ~ ssIk(key(X1,b)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause37) ).
cnf(clause5,axiom,
ssP(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause5) ).
cnf(c_0_16,plain,
( ~ ssBf(X2)
| ~ ssM(sent(X1,b,pair(X1,X2)))
| ssM(sent(b,t,triple(b,nb(X2),encr(triple(X1,X2,tb(X2)),bt)))) ),
inference(fof_simplification,[status(thm)],[clause33]) ).
cnf(c_0_17,plain,
( ~ ssSb(pair(X1,X3))
| ~ ssM(sent(X1,b,pair(encr(triple(X1,X2,tb(X3)),bt),encr(nb(X3),X2))))
| ssBk(key(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause34]) ).
cnf(c_0_18,plain,
( ~ ssP(X3)
| ~ ssP(X2)
| ~ ssIm(X1)
| ssM(sent(X2,X3,X1)) ),
inference(fof_simplification,[status(thm)],[clause27]) ).
cnf(c_0_19,plain,
( ~ ssM(sent(X1,X2,X3))
| ssIm(X3) ),
inference(fof_simplification,[status(thm)],[clause20]) ).
cnf(c_0_20,plain,
( ~ ssBf(X2)
| ~ ssM(sent(X1,b,pair(X1,X2)))
| ssM(sent(b,t,triple(b,nb(X2),encr(triple(X1,X2,tb(X2)),bt)))) ),
c_0_16 ).
cnf(c_0_21,axiom,
ssM(sent(a,b,pair(a,na))),
clause16 ).
cnf(c_0_22,axiom,
ssBf(na),
clause3 ).
cnf(c_0_23,plain,
( ~ ssSb(pair(X1,X3))
| ~ ssM(sent(X1,b,pair(encr(triple(X1,X2,tb(X3)),bt),encr(nb(X3),X2))))
| ssBk(key(X2,X1)) ),
c_0_17 ).
cnf(c_0_24,plain,
( ~ ssP(X3)
| ~ ssP(X2)
| ~ ssIm(X1)
| ssM(sent(X2,X3,X1)) ),
c_0_18 ).
cnf(c_0_25,axiom,
ssP(b),
clause4 ).
cnf(c_0_26,plain,
( ~ ssIm(X2)
| ~ ssIm(X1)
| ssIm(pair(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause26]) ).
cnf(c_0_27,plain,
( ~ ssIm(triple(X1,X2,X3))
| ssIm(X3) ),
inference(fof_simplification,[status(thm)],[clause17]) ).
cnf(c_0_28,plain,
( ~ ssM(sent(X1,X2,X3))
| ssIm(X3) ),
c_0_19 ).
cnf(c_0_29,plain,
ssM(sent(b,t,triple(b,nb(na),encr(triple(a,na,tb(na)),bt)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_30,plain,
( ~ ssBf(X2)
| ~ ssM(sent(X1,b,pair(X1,X2)))
| ssSb(pair(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause30]) ).
cnf(c_0_31,plain,
( ~ ssP(X3)
| ~ ssIk(key(X2,X3))
| ~ ssIm(X1)
| ssIm(encr(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause29]) ).
cnf(c_0_32,plain,
( ~ ssP(X2)
| ~ ssIm(X1)
| ssIk(key(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause25]) ).
cnf(c_0_33,plain,
( ~ ssP(X2)
| ~ ssIm(pair(encr(triple(X2,X1,tb(X3)),bt),encr(nb(X3),X1)))
| ~ ssSb(pair(X2,X3))
| ssBk(key(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_34,plain,
( ~ ssIm(X2)
| ~ ssIm(X1)
| ssIm(pair(X1,X2)) ),
c_0_26 ).
cnf(c_0_35,plain,
( ~ ssIm(triple(X1,X2,X3))
| ssIm(X3) ),
c_0_27 ).
cnf(c_0_36,plain,
ssIm(triple(b,nb(na),encr(triple(a,na,tb(na)),bt))),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
( ~ ssBf(X2)
| ~ ssM(sent(X1,b,pair(X1,X2)))
| ssSb(pair(X1,X2)) ),
c_0_30 ).
cnf(c_0_38,plain,
( ~ ssP(X3)
| ~ ssIk(key(X2,X3))
| ~ ssIm(X1)
| ssIm(encr(X1,X2)) ),
c_0_31 ).
cnf(c_0_39,plain,
( ~ ssP(X2)
| ~ ssIm(X1)
| ssIk(key(X1,X2)) ),
c_0_32 ).
cnf(c_0_40,plain,
( ~ ssIm(triple(X1,X2,X3))
| ssIm(X2) ),
inference(fof_simplification,[status(thm)],[clause18]) ).
cnf(c_0_41,plain,
( ~ ssIm(pair(X1,X2))
| ssIm(X2) ),
inference(fof_simplification,[status(thm)],[clause14]) ).
cnf(c_0_42,negated_conjecture,
( ~ ssBk(key(X1,a))
| ~ ssIk(key(X1,b)) ),
inference(fof_simplification,[status(thm)],[clause37]) ).
cnf(c_0_43,plain,
( ~ ssP(X2)
| ~ ssIm(encr(nb(X3),X1))
| ~ ssIm(encr(triple(X2,X1,tb(X3)),bt))
| ~ ssSb(pair(X2,X3))
| ssBk(key(X1,X2)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_44,plain,
ssIm(encr(triple(a,na,tb(na)),bt)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_45,plain,
ssSb(pair(a,na)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_21]),c_0_22])]) ).
cnf(c_0_46,axiom,
ssP(a),
clause5 ).
cnf(c_0_47,plain,
( ~ ssP(X3)
| ~ ssIm(X2)
| ~ ssIm(X1)
| ssIm(encr(X1,X2)) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_48,plain,
( ~ ssIm(triple(X1,X2,X3))
| ssIm(X2) ),
c_0_40 ).
cnf(c_0_49,plain,
( ~ ssIm(pair(X1,X2))
| ssIm(X2) ),
c_0_41 ).
cnf(c_0_50,plain,
ssIm(pair(a,na)),
inference(spm,[status(thm)],[c_0_28,c_0_21]) ).
cnf(c_0_51,negated_conjecture,
( ~ ssBk(key(X1,a))
| ~ ssIk(key(X1,b)) ),
c_0_42 ).
cnf(c_0_52,plain,
( ~ ssIm(encr(nb(na),na))
| ssBk(key(na,a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46])]) ).
cnf(c_0_53,plain,
( ~ ssIm(X2)
| ~ ssIm(X1)
| ssIm(encr(X1,X2)) ),
inference(spm,[status(thm)],[c_0_47,c_0_46]) ).
cnf(c_0_54,plain,
ssIm(nb(na)),
inference(spm,[status(thm)],[c_0_48,c_0_36]) ).
cnf(c_0_55,plain,
ssIm(na),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_56,negated_conjecture,
( ~ ssBk(key(X1,a))
| ~ ssIm(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_39]),c_0_25])]) ).
cnf(c_0_57,plain,
ssBk(key(na,a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_55])]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN982-1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n010.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 11:32:26 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.44 % Version: 3.5.1
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % Starting sh5l with 300s (1) cores
% 0.11/0.44 % new_bool_1 with pid 773253 completed with status 0
% 0.11/0.44 % Result found by new_bool_1
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.44 % Search class: FHHNS-FFMM32-MFFFFFNN
% 0.11/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.44 % SubtermCWHack with pid 773255 completed with status 0
% 0.11/0.44 % Result found by SubtermCWHack
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.44 % Search class: FHHNS-FFMM32-MFFFFFNN
% 0.11/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.44 % Preprocessing time : 0.002 s
% 0.11/0.44
% 0.11/0.44 % Proof found!
% 0.11/0.44 % SZS status Unsatisfiable
% 0.11/0.44 % SZS output start CNFRefutation
% See solution above
% 0.11/0.44 % Parsed axioms : 37
% 0.11/0.44 % Removed by relevancy pruning/SinE : 7
% 0.11/0.44 % Initial clauses : 30
% 0.11/0.44 % Removed in clause preprocessing : 0
% 0.11/0.44 % Initial clauses in saturation : 30
% 0.11/0.44 % Processed clauses : 54
% 0.11/0.44 % ...of these trivial : 0
% 0.11/0.44 % ...subsumed : 0
% 0.11/0.44 % ...remaining for further processing : 54
% 0.11/0.44 % Other redundant clauses eliminated : 0
% 0.11/0.44 % Clauses deleted for lack of memory : 0
% 0.11/0.44 % Backward-subsumed : 2
% 0.11/0.44 % Backward-rewritten : 1
% 0.11/0.44 % Generated clauses : 41
% 0.11/0.44 % ...of the previous two non-redundant : 32
% 0.11/0.44 % ...aggressively subsumed : 0
% 0.11/0.44 % Contextual simplify-reflections : 0
% 0.11/0.44 % Paramodulations : 41
% 0.11/0.44 % Factorizations : 0
% 0.11/0.44 % NegExts : 0
% 0.11/0.44 % Equation resolutions : 0
% 0.11/0.44 % Disequality decompositions : 0
% 0.11/0.44 % Total rewrite steps : 20
% 0.11/0.44 % ...of those cached : 10
% 0.11/0.44 % Propositional unsat checks : 0
% 0.11/0.44 % Propositional check models : 0
% 0.11/0.44 % Propositional check unsatisfiable : 0
% 0.11/0.44 % Propositional clauses : 0
% 0.11/0.44 % Propositional clauses after purity: 0
% 0.11/0.44 % Propositional unsat core size : 0
% 0.11/0.44 % Propositional preprocessing time : 0.000
% 0.11/0.44 % Propositional encoding time : 0.000
% 0.11/0.44 % Propositional solver time : 0.000
% 0.11/0.44 % Success case prop preproc time : 0.000
% 0.11/0.44 % Success case prop encoding time : 0.000
% 0.11/0.44 % Success case prop solver time : 0.000
% 0.11/0.44 % Current number of processed clauses : 51
% 0.11/0.44 % Positive orientable unit clauses : 22
% 0.11/0.44 % Positive unorientable unit clauses: 0
% 0.11/0.44 % Negative unit clauses : 0
% 0.11/0.44 % Non-unit-clauses : 29
% 0.11/0.44 % Current number of unprocessed clauses: 4
% 0.11/0.44 % ...number of literals in the above : 20
% 0.11/0.44 % Current number of archived formulas : 0
% 0.11/0.44 % Current number of archived clauses : 3
% 0.11/0.44 % Clause-clause subsumption calls (NU) : 216
% 0.11/0.44 % Rec. Clause-clause subsumption calls : 96
% 0.11/0.44 % Non-unit clause-clause subsumptions : 2
% 0.11/0.44 % Unit Clause-clause subsumption calls : 10
% 0.11/0.44 % Rewrite failures with RHS unbound : 0
% 0.11/0.44 % BW rewrite match attempts : 2
% 0.11/0.44 % BW rewrite match successes : 1
% 0.11/0.44 % Condensation attempts : 0
% 0.11/0.44 % Condensation successes : 0
% 0.11/0.44 % Termbank termtop insertions : 1842
% 0.11/0.44 % Search garbage collected termcells : 91
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.006 s
% 0.11/0.44 % System time : 0.002 s
% 0.11/0.44 % Total time : 0.008 s
% 0.11/0.44 % Maximum resident set size: 3668 pages
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.009 s
% 0.11/0.44 % System time : 0.005 s
% 0.11/0.44 % Total time : 0.014 s
% 0.11/0.44 % Maximum resident set size: 4608 pages
% 0.11/0.44 % E exiting
%------------------------------------------------------------------------------