%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWX240_1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:14:22 PM UTC 2026
% Result : Theorem 1.34s 0.72s
% Output : CNFRefutation 1.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 16
% Syntax : Number of formulae : 77 ( 25 unt; 0 def)
% Number of atoms : 192 ( 35 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 205 ( 90 ~; 90 |; 8 &)
% ( 7 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 6 con; 0-3 aty)
% Number of variables : 160 ( 21 sgn 69 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goal_057,conjecture,
? [X10,X18] :
~ ( typeCorrect(X10)
=> ( elem(l,run(X18,X10))
<=> elem(l,run(cons(h,X18),X10)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_057) ).
fof(axiom_055,axiom,
! [X1,X17,X13,X14] :
( eval(X1,X17)
=> run(X1,ifThenElse(X17,X13,X14)) = run(X1,X13) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_055) ).
fof(axiom_045,axiom,
! [X1] : eval(X1,tT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_045) ).
fof(axiom_052,axiom,
! [X1,X8,X9] :
( eval(X1,X9)
=> run(X1,assign(X8,X9)) = cons(X8,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_052) ).
fof(axiom_039,axiom,
! [X12,X13,X14] :
( typeCorrect(ifThenElse(X12,X13,X14))
<=> ( typeCorrect(X14)
& typeCorrect(X13) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_039) ).
fof(axiom_043,axiom,
! [X1,X8,X15] :
( elem(X1,cons(X8,X15))
<=> ( elem(X1,X15)
| X8 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_043) ).
fof(axiom_037,axiom,
! [X9,X2] :
( typeCorrect(assign(low(X2),X9))
<=> ~ secret(X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_037) ).
fof(axiom_040,axiom,
l = low(zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_040) ).
fof(axiom_056,axiom,
! [X1,X17,X13,X14] :
( ~ eval(X1,X17)
=> run(X1,ifThenElse(X17,X13,X14)) = run(X1,X14) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_056) ).
fof(axiom_035,axiom,
typeCorrect(skip),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_035) ).
fof(axiom_047,axiom,
! [X1,X8] :
( eval(X1,var(X8))
<=> elem(X8,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_047) ).
fof(axiom_051,axiom,
! [X1] : run(X1,skip) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_051) ).
fof(axiom_042,axiom,
! [X1] : ~ elem(X1,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_042) ).
fof(axiom_031,axiom,
! [X1] :
( X1 != nand(proj1Nand(X1),proj2Nand(X1))
=> ( X1 != var(proj1Var(X1))
=> ~ secret(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_031) ).
fof(axiom_012,axiom,
! [X1,X2] : nand(X1,X2) != tT,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_012) ).
fof(axiom_016,axiom,
! [X1] : tT != var(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_016) ).
fof(c_0_16,negated_conjecture,
~ ? [X10,X18] :
~ ( typeCorrect(X10)
=> ( elem(l,run(X18,X10))
<=> elem(l,run(cons(h,X18),X10)) ) ),
inference(assume_negation,[status(cth)],[goal_057]) ).
fof(c_0_17,negated_conjecture,
! [X133,X134] :
( ( ~ typeCorrect(X133)
| elem(l,run(X134,X133))
| ~ elem(l,run(cons(h,X134),X133)) )
& ( ~ typeCorrect(X133)
| elem(l,run(cons(h,X134),X133))
| ~ elem(l,run(X134,X133)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
fof(c_0_18,plain,
! [X125,X126,X127,X128] :
( run(X125,ifThenElse(X126,X127,X128)) = run(X125,X127)
| ~ eval(X125,X126) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_055])])]) ).
cnf(c_0_19,negated_conjecture,
( ~ typeCorrect(X2)
| ~ elem(l,run(X1,X2))
| elem(l,run(cons(h,X1),X2)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,plain,
( ~ eval(X1,X2)
| run(X1,ifThenElse(X2,X3,X4)) = run(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( ~ typeCorrect(ifThenElse(X3,X2,X4))
| ~ elem(l,run(X1,ifThenElse(X3,X2,X4)))
| ~ eval(cons(h,X1),X3)
| elem(l,run(cons(h,X1),X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_22,plain,
! [X104] : eval(X104,tT),
inference(variable_rename,[status(thm)],[axiom_045]) ).
cnf(c_0_23,negated_conjecture,
( ~ typeCorrect(ifThenElse(X3,X2,X4))
| ~ elem(l,run(X1,X2))
| ~ eval(X1,X3)
| ~ eval(cons(h,X1),X3)
| elem(l,run(cons(h,X1),X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_24,plain,
eval(X1,tT),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_25,plain,
! [X116,X117,X118] :
( run(X116,assign(X117,X118)) = cons(X117,X116)
| ~ eval(X116,X118) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_052])])]) ).
cnf(c_0_26,negated_conjecture,
( ~ typeCorrect(ifThenElse(tT,X2,X3))
| ~ elem(l,run(X1,X2))
| elem(l,run(cons(h,X1),X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_24])]) ).
cnf(c_0_27,plain,
( ~ eval(X1,X2)
| run(X1,assign(X3,X2)) = cons(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_28,plain,
! [X94,X95,X96] :
( ( typeCorrect(ifThenElse(X94,X95,X96))
| ~ typeCorrect(X96)
| ~ typeCorrect(X95) )
& ( ~ typeCorrect(ifThenElse(X94,X95,X96))
| typeCorrect(X96) )
& ( ~ typeCorrect(ifThenElse(X94,X95,X96))
| typeCorrect(X95) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_039])])])]) ).
fof(c_0_29,plain,
! [X98,X99,X100] :
( ( elem(X98,cons(X99,X100))
| ~ elem(X98,X100) )
& ( elem(X98,cons(X99,X100))
| X99 != X98 )
& ( elem(X98,X100)
| X99 = X98
| ~ elem(X98,cons(X99,X100)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_043])])])]) ).
fof(c_0_30,plain,
! [X9,X2] :
( typeCorrect(assign(low(X2),X9))
<=> ~ secret(X9) ),
inference(fof_simplification,[status(thm)],[axiom_037]) ).
cnf(c_0_31,negated_conjecture,
( ~ typeCorrect(ifThenElse(tT,assign(X2,X3),X4))
| ~ elem(l,cons(X2,X1))
| ~ eval(X1,X3)
| elem(l,run(cons(h,X1),assign(X2,X3))) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( ~ typeCorrect(X2)
| ~ typeCorrect(X1)
| typeCorrect(ifThenElse(X3,X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,plain,
( X1 != X2
| elem(X2,cons(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_34,plain,
! [X90,X91] :
( ( typeCorrect(assign(low(X91),X90))
| secret(X90) )
& ( ~ secret(X90)
| ~ typeCorrect(assign(low(X91),X90)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])]) ).
cnf(c_0_35,negated_conjecture,
( ~ typeCorrect(X4)
| ~ typeCorrect(assign(X2,X3))
| ~ elem(l,cons(X2,X1))
| ~ eval(X1,X3)
| elem(l,run(cons(h,X1),assign(X2,X3))) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_37,plain,
( typeCorrect(assign(low(X2),X1))
| secret(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_38,plain,
l = low(zero),
inference(split_conjunct,[status(thm)],[axiom_040]) ).
cnf(c_0_39,negated_conjecture,
( ~ typeCorrect(X3)
| ~ typeCorrect(assign(l,X2))
| ~ eval(X1,X2)
| elem(l,run(cons(h,X1),assign(l,X2))) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
( secret(X1)
| typeCorrect(assign(l,X1)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
fof(c_0_41,plain,
! [X1,X17,X13,X14] :
( ~ eval(X1,X17)
=> run(X1,ifThenElse(X17,X13,X14)) = run(X1,X14) ),
inference(fof_simplification,[status(thm)],[axiom_056]) ).
cnf(c_0_42,negated_conjecture,
( ~ typeCorrect(X3)
| ~ eval(X1,X2)
| secret(X2)
| elem(l,run(cons(h,X1),assign(l,X2))) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
( ~ typeCorrect(X2)
| ~ elem(l,run(cons(h,X1),X2))
| elem(l,run(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_44,plain,
! [X129,X130,X131,X132] :
( run(X129,ifThenElse(X130,X131,X132)) = run(X129,X132)
| eval(X129,X130) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])]) ).
cnf(c_0_45,negated_conjecture,
( ~ typeCorrect(X2)
| secret(tT)
| elem(l,run(cons(h,X1),assign(l,tT))) ),
inference(spm,[status(thm)],[c_0_42,c_0_24]) ).
cnf(c_0_46,plain,
typeCorrect(skip),
inference(split_conjunct,[status(thm)],[axiom_035]) ).
cnf(c_0_47,negated_conjecture,
( ~ typeCorrect(ifThenElse(X2,X3,X4))
| ~ elem(l,run(cons(h,X1),X3))
| ~ eval(cons(h,X1),X2)
| elem(l,run(X1,ifThenElse(X2,X3,X4))) ),
inference(spm,[status(thm)],[c_0_43,c_0_20]) ).
cnf(c_0_48,plain,
( run(X1,ifThenElse(X2,X3,X4)) = run(X1,X4)
| eval(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( secret(tT)
| elem(l,run(cons(h,X1),assign(l,tT))) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( ~ typeCorrect(ifThenElse(X2,X4,X3))
| ~ elem(l,run(cons(h,X1),X4))
| ~ eval(cons(h,X1),X2)
| elem(l,run(X1,X3))
| eval(X1,X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,negated_conjecture,
( secret(tT)
| elem(l,run(X1,assign(l,tT))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_49]),c_0_40]) ).
cnf(c_0_52,negated_conjecture,
( ~ typeCorrect(ifThenElse(X2,assign(l,tT),X3))
| ~ eval(cons(h,X1),X2)
| secret(tT)
| elem(l,run(X1,X3))
| eval(X1,X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
fof(c_0_53,plain,
! [X106,X107] :
( ( eval(X106,var(X107))
| ~ elem(X107,X106) )
& ( elem(X107,X106)
| ~ eval(X106,var(X107)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_047])])]) ).
cnf(c_0_54,negated_conjecture,
( ~ typeCorrect(X3)
| ~ eval(cons(h,X1),X2)
| secret(tT)
| elem(l,run(X1,X3))
| eval(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_32]),c_0_40]) ).
cnf(c_0_55,plain,
( ~ elem(X1,X2)
| eval(X2,var(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_56,negated_conjecture,
( ~ typeCorrect(X3)
| ~ elem(X2,cons(h,X1))
| secret(tT)
| elem(l,run(X1,X3))
| eval(X1,var(X2)) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
fof(c_0_57,plain,
! [X115] : run(X115,skip) = X115,
inference(variable_rename,[status(thm)],[axiom_051]) ).
fof(c_0_58,plain,
! [X1] : ~ elem(X1,nil),
inference(fof_simplification,[status(thm)],[axiom_042]) ).
cnf(c_0_59,negated_conjecture,
( ~ typeCorrect(X2)
| secret(tT)
| elem(l,run(X1,X2))
| eval(X1,var(h)) ),
inference(spm,[status(thm)],[c_0_56,c_0_36]) ).
cnf(c_0_60,plain,
run(X1,skip) = X1,
inference(split_conjunct,[status(thm)],[c_0_57]) ).
fof(c_0_61,plain,
! [X1] :
( X1 != nand(proj1Nand(X1),proj2Nand(X1))
=> ( X1 != var(proj1Var(X1))
=> ~ secret(X1) ) ),
inference(fof_simplification,[status(thm)],[axiom_031]) ).
fof(c_0_62,plain,
! [X97] : ~ elem(X97,nil),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_58])]) ).
cnf(c_0_63,plain,
( ~ eval(X1,var(X2))
| elem(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_64,negated_conjecture,
( secret(tT)
| elem(l,X1)
| eval(X1,var(h)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_46]),c_0_60]) ).
fof(c_0_65,plain,
! [X1,X2] : nand(X1,X2) != tT,
inference(fof_simplification,[status(thm)],[axiom_012]) ).
fof(c_0_66,plain,
! [X1] : tT != var(X1),
inference(fof_simplification,[status(thm)],[axiom_016]) ).
fof(c_0_67,plain,
! [X83] :
( ~ secret(X83)
| X83 = var(proj1Var(X83))
| X83 = nand(proj1Nand(X83),proj2Nand(X83)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_61])])]) ).
cnf(c_0_68,plain,
~ elem(X1,nil),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_69,negated_conjecture,
( secret(tT)
| elem(h,X1)
| elem(l,X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
fof(c_0_70,plain,
! [X36,X37] : nand(X36,X37) != tT,
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_65])]) ).
fof(c_0_71,plain,
! [X43] : tT != var(X43),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_66])]) ).
cnf(c_0_72,plain,
( ~ secret(X1)
| X1 = var(proj1Var(X1))
| X1 = nand(proj1Nand(X1),proj2Nand(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_73,negated_conjecture,
secret(tT),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_68]) ).
cnf(c_0_74,plain,
nand(X1,X2) != tT,
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_75,plain,
tT != var(X1),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_76,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74]),c_0_75]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWX240_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n006.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 10:37:43 UTC 2026
% 0.18/0.46 % CPUTime :
% 0.18/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 1.34/0.72 % Version: 3.5.1
% 1.34/0.72 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.34/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.34/0.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.34/0.72 % Starting new_bool_3 with 300s (1) cores
% 1.34/0.72 % Starting new_bool_1 with 300s (1) cores
% 1.34/0.72 % Starting sh5l with 300s (1) cores
% 1.34/0.72 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2641331 completed with status 0
% 1.34/0.72 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.34/0.72 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.34/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.34/0.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.34/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.34/0.72 % No SInE strategy applied
% 1.34/0.72 % Search class: FGHSM-FFMS31-SFFFFFNN
% 1.34/0.72 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.34/0.72 % Starting SubtermCWHack with 136s (1) cores
% 1.34/0.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.34/0.72 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 1.34/0.72 % Starting new_bool_3 with 136s (1) cores
% 1.34/0.72 % Starting new_bool_1 with 136s (1) cores
% 1.34/0.72 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2641339 completed with status 0
% 1.34/0.72 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.34/0.72 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.34/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.34/0.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.34/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.34/0.72 % No SInE strategy applied
% 1.34/0.72 % Search class: FGHSM-FFMS31-SFFFFFNN
% 1.34/0.72 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.34/0.72 % Starting SubtermCWHack with 136s (1) cores
% 1.34/0.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.34/0.72 % Preprocessing time : 0.002 s
% 1.34/0.72 % Presaturation interreduction done
% 1.34/0.72
% 1.34/0.72 % Proof found!
% 1.34/0.72 % SZS status Theorem
% 1.34/0.72 % SZS output start CNFRefutation
% See solution above
% 1.34/0.72 % Parsed axioms : 57
% 1.34/0.72 % Removed by relevancy pruning/SinE : 0
% 1.34/0.72 % Initial clauses : 70
% 1.34/0.72 % Removed in clause preprocessing : 0
% 1.34/0.72 % Initial clauses in saturation : 70
% 1.34/0.72 % Processed clauses : 916
% 1.34/0.72 % ...of these trivial : 86
% 1.34/0.72 % ...subsumed : 315
% 1.34/0.72 % ...remaining for further processing : 515
% 1.34/0.72 % Other redundant clauses eliminated : 2
% 1.34/0.72 % Clauses deleted for lack of memory : 0
% 1.34/0.72 % Backward-subsumed : 28
% 1.34/0.72 % Backward-rewritten : 51
% 1.34/0.72 % Generated clauses : 6785
% 1.34/0.72 % ...of the previous two non-redundant : 6192
% 1.34/0.72 % ...aggressively subsumed : 0
% 1.34/0.72 % Contextual simplify-reflections : 5
% 1.34/0.72 % Paramodulations : 6783
% 1.34/0.72 % Factorizations : 0
% 1.34/0.72 % NegExts : 0
% 1.34/0.72 % Equation resolutions : 2
% 1.34/0.72 % Disequality decompositions : 0
% 1.34/0.72 % Total rewrite steps : 4426
% 1.34/0.72 % ...of those cached : 4119
% 1.34/0.72 % Propositional unsat checks : 0
% 1.34/0.72 % Propositional check models : 0
% 1.34/0.72 % Propositional check unsatisfiable : 0
% 1.34/0.72 % Propositional clauses : 0
% 1.34/0.72 % Propositional clauses after purity: 0
% 1.34/0.72 % Propositional unsat core size : 0
% 1.34/0.72 % Propositional preprocessing time : 0.000
% 1.34/0.72 % Propositional encoding time : 0.000
% 1.34/0.72 % Propositional solver time : 0.000
% 1.34/0.72 % Success case prop preproc time : 0.000
% 1.34/0.72 % Success case prop encoding time : 0.000
% 1.34/0.72 % Success case prop solver time : 0.000
% 1.34/0.72 % Current number of processed clauses : 364
% 1.34/0.72 % Positive orientable unit clauses : 58
% 1.34/0.72 % Positive unorientable unit clauses: 0
% 1.34/0.72 % Negative unit clauses : 21
% 1.34/0.72 % Non-unit-clauses : 285
% 1.34/0.72 % Current number of unprocessed clauses: 5280
% 1.34/0.72 % ...number of literals in the above : 20131
% 1.34/0.72 % Current number of archived formulas : 0
% 1.34/0.72 % Current number of archived clauses : 149
% 1.34/0.72 % Clause-clause subsumption calls (NU) : 9663
% 1.34/0.72 % Rec. Clause-clause subsumption calls : 6229
% 1.34/0.72 % Non-unit clause-clause subsumptions : 344
% 1.34/0.72 % Unit Clause-clause subsumption calls : 529
% 1.34/0.72 % Rewrite failures with RHS unbound : 0
% 1.34/0.72 % BW rewrite match attempts : 948
% 1.34/0.72 % BW rewrite match successes : 34
% 1.34/0.72 % Condensation attempts : 0
% 1.34/0.72 % Condensation successes : 0
% 1.34/0.72 % Termbank termtop insertions : 226331
% 1.34/0.72 % Search garbage collected termcells : 467
% 1.34/0.72
% 1.34/0.72 % -------------------------------------------------
% 1.34/0.72 % User time : 0.154 s
% 1.34/0.72 % System time : 0.008 s
% 1.34/0.72 % Total time : 0.162 s
% 1.34/0.72 % Maximum resident set size: 3692 pages
% 1.34/0.72
% 1.34/0.72 % -------------------------------------------------
% 1.34/0.72 % User time : 0.748 s
% 1.34/0.72 % System time : 0.044 s
% 1.34/0.72 % Total time : 0.792 s
% 1.34/0.72 % Maximum resident set size: 4608 pages
% 1.34/0.72 % E exiting
%------------------------------------------------------------------------------