TSTP Solution File: AGT031^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : AGT031^1 : TPTP v8.2.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 : Mon May 20 17:57:45 EDT 2024
% Result : Theorem 0.36s 0.56s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 40
% Syntax : Number of formulae : 80 ( 37 unt; 23 typ; 0 def)
% Number of atoms : 153 ( 23 equ; 0 cnn)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 402 ( 57 ~; 42 |; 3 &; 296 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 106 ( 106 >; 0 *; 0 +; 0 <<)
% Number of symbols : 24 ( 22 usr; 4 con; 0-4 aty)
% Number of variables : 121 ( 52 ^ 65 !; 4 ?; 121 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mu: $tType ).
thf(decl_24,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_25,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_26,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_27,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_31,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_33,type,
mexists_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_37,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_40,type,
msymmetric: ( $i > $i > $o ) > $o ).
thf(decl_41,type,
mserial: ( $i > $i > $o ) > $o ).
thf(decl_49,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_53,type,
a1: $i > $i > $o ).
thf(decl_54,type,
a2: $i > $i > $o ).
thf(decl_55,type,
a3: $i > $i > $o ).
thf(decl_57,type,
piotr: mu ).
thf(decl_60,type,
beer: mu ).
thf(decl_61,type,
likes: mu > mu > $i > $o ).
thf(decl_62,type,
very_much_likes: mu > mu > $i > $o ).
thf(decl_68,type,
esk3_4: $i > mu > mu > $i > $i ).
thf(decl_69,type,
esk4_4: $i > mu > mu > $i > $i ).
thf(decl_71,type,
esk6_1: $i > $i ).
thf(decl_73,type,
esk8_1: $i > $i ).
thf(decl_74,type,
esk9_0: $i ).
thf(msymmetric,axiom,
( msymmetric
= ( ^ [X13: $i > $i > $o] :
! [X15: $i,X16: $i] :
( ( X13 @ X15 @ X16 )
=> ( X13 @ X16 @ X15 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',msymmetric) ).
thf(mserial,axiom,
( mserial
= ( ^ [X13: $i > $i > $o] :
! [X15: $i] :
? [X16: $i] : ( X13 @ X15 @ X16 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mserial) ).
thf(mand,axiom,
( mand
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mnot @ ( mor @ ( mnot @ X6 ) @ ( mnot @ X7 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mand) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mor) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mimplies) ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(axioms_B_a1,axiom,
msymmetric @ a1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axioms_B_a1) ).
thf(axioms_D_a1,axiom,
mserial @ a1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axioms_D_a1) ).
thf(mforall_ind,axiom,
( mforall_ind
= ( ^ [X8: mu > $i > $o,X3: $i] :
! [X1: mu] : ( X8 @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mforall_ind) ).
thf(axiom_a2_3,axiom,
mvalid @ ( mbox @ a1 @ ( likes @ piotr @ beer ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_a2_3) ).
thf(mexists_ind,axiom,
( mexists_ind
= ( ^ [X11: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [X1: mu] : ( mnot @ ( X11 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mexists_ind) ).
thf(axiom_a3_4,axiom,
( mvalid
@ ( mforall_ind
@ ^ [X1: mu] :
( mforall_ind
@ ^ [X2: mu] : ( mbox @ a3 @ ( mimplies @ ( mand @ ( likes @ X1 @ X2 ) @ ( mand @ ( mbox @ a1 @ ( likes @ X1 @ X2 ) ) @ ( mbox @ a2 @ ( likes @ X1 @ X2 ) ) ) ) @ ( very_much_likes @ X1 @ X2 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_a3_4) ).
thf(axioms_B_a3,axiom,
msymmetric @ a3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axioms_B_a3) ).
thf(axioms_D_a3,axiom,
mserial @ a3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axioms_D_a3) ).
thf(conj,conjecture,
( mvalid
@ ( mexists_ind
@ ^ [X1: mu] :
( mexists_ind
@ ^ [X2: mu] : ( very_much_likes @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(c_0_17,plain,
( msymmetric
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i,X16: $i] :
( ( Z0 @ X15 @ X16 )
=> ( Z0 @ X16 @ X15 ) ) ) ),
inference(fof_simplification,[status(thm)],[msymmetric]) ).
thf(c_0_18,plain,
( mserial
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i] :
? [X16: $i] : ( Z0 @ X15 @ X16 ) ) ),
inference(fof_simplification,[status(thm)],[mserial]) ).
thf(c_0_19,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
thf(c_0_20,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_21,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_22,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_23,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X14: $i] :
( ~ ( Z0 @ Z2 @ X14 )
| ( Z1 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_24,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_25,plain,
! [X81: $i,X82: $i] :
( ( a1 @ X81 @ X82 )
=> ( a1 @ X82 @ X81 ) ),
inference(apply_def,[status(thm)],[axioms_B_a1,c_0_17]) ).
thf(c_0_26,plain,
! [X87: $i] :
? [X88: $i] : ( a1 @ X87 @ X88 ),
inference(apply_def,[status(thm)],[axioms_D_a1,c_0_18]) ).
thf(c_0_27,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
thf(c_0_28,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_22,c_0_20]),c_0_21]) ).
thf(c_0_29,plain,
( mforall_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
! [X1: mu] : ( Z0 @ X1 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_ind]) ).
thf(c_0_30,plain,
! [X42: $i,X41: $i] :
( ~ ( a1 @ X42 @ X41 )
| ( likes @ piotr @ beer @ X41 ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom_a2_3,c_0_23]),c_0_24])]) ).
thf(c_0_31,plain,
! [X194: $i,X195: $i] :
( ~ ( a1 @ X194 @ X195 )
| ( a1 @ X195 @ X194 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])]) ).
thf(c_0_32,plain,
! [X200: $i] : ( a1 @ X200 @ ( esk6_1 @ X200 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_26])]) ).
thf(c_0_33,plain,
( mexists_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
~ ! [X22: mu] :
~ ( Z0 @ X22 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mexists_ind]) ).
thf(c_0_34,plain,
! [X60: $i,X59: mu,X58: mu,X57: $i] :
( ~ ( a3 @ X60 @ X57 )
| ~ ~ ( ~ ( likes @ X59 @ X58 @ X57 )
| ~ ~ ( ~ ! [X55: $i] :
( ~ ( a1 @ X57 @ X55 )
| ( likes @ X59 @ X58 @ X55 ) )
| ~ ! [X56: $i] :
( ~ ( a2 @ X57 @ X56 )
| ( likes @ X59 @ X58 @ X56 ) ) ) )
| ( very_much_likes @ X59 @ X58 @ X57 ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_a3_4]),c_0_27]),c_0_28]),c_0_29]),c_0_23]),c_0_24])]) ).
thf(c_0_35,plain,
! [X154: $i,X155: $i] :
( ~ ( a1 @ X154 @ X155 )
| ( likes @ piotr @ beer @ X155 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_30])]) ).
thf(c_0_36,plain,
! [X3: $i,X14: $i] :
( ( a1 @ X14 @ X3 )
| ~ ( a1 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_37,plain,
! [X3: $i] : ( a1 @ X3 @ ( esk6_1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
thf(c_0_38,plain,
! [X85: $i,X86: $i] :
( ( a3 @ X85 @ X86 )
=> ( a3 @ X86 @ X85 ) ),
inference(apply_def,[status(thm)],[axioms_B_a3,c_0_17]) ).
thf(c_0_39,plain,
! [X91: $i] :
? [X92: $i] : ( a3 @ X91 @ X92 ),
inference(apply_def,[status(thm)],[axioms_D_a3,c_0_18]) ).
thf(c_0_40,plain,
( mexists_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
~ ! [X22: mu] :
~ ( Z0 @ X22 @ Z1 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_33,c_0_20]),c_0_29]) ).
thf(c_0_41,plain,
! [X168: $i,X169: mu,X170: mu,X171: $i] :
( ( ( a2 @ X171 @ ( esk4_4 @ X168 @ X169 @ X170 @ X171 ) )
| ( a1 @ X171 @ ( esk3_4 @ X168 @ X169 @ X170 @ X171 ) )
| ~ ( likes @ X169 @ X170 @ X171 )
| ( very_much_likes @ X169 @ X170 @ X171 )
| ~ ( a3 @ X168 @ X171 ) )
& ( ~ ( likes @ X169 @ X170 @ ( esk4_4 @ X168 @ X169 @ X170 @ X171 ) )
| ( a1 @ X171 @ ( esk3_4 @ X168 @ X169 @ X170 @ X171 ) )
| ~ ( likes @ X169 @ X170 @ X171 )
| ( very_much_likes @ X169 @ X170 @ X171 )
| ~ ( a3 @ X168 @ X171 ) )
& ( ( a2 @ X171 @ ( esk4_4 @ X168 @ X169 @ X170 @ X171 ) )
| ~ ( likes @ X169 @ X170 @ ( esk3_4 @ X168 @ X169 @ X170 @ X171 ) )
| ~ ( likes @ X169 @ X170 @ X171 )
| ( very_much_likes @ X169 @ X170 @ X171 )
| ~ ( a3 @ X168 @ X171 ) )
& ( ~ ( likes @ X169 @ X170 @ ( esk4_4 @ X168 @ X169 @ X170 @ X171 ) )
| ~ ( likes @ X169 @ X170 @ ( esk3_4 @ X168 @ X169 @ X170 @ X171 ) )
| ~ ( likes @ X169 @ X170 @ X171 )
| ( very_much_likes @ X169 @ X170 @ X171 )
| ~ ( a3 @ X168 @ X171 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])])])]) ).
thf(c_0_42,plain,
! [X3: $i,X14: $i] :
( ( likes @ piotr @ beer @ X14 )
| ~ ( a1 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
thf(c_0_43,plain,
! [X3: $i] : ( a1 @ ( esk6_1 @ X3 ) @ X3 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
thf(c_0_44,plain,
! [X198: $i,X199: $i] :
( ~ ( a3 @ X198 @ X199 )
| ( a3 @ X199 @ X198 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])])]) ).
thf(c_0_45,plain,
! [X204: $i] : ( a3 @ X204 @ ( esk8_1 @ X204 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_39])]) ).
thf(c_0_46,negated_conjecture,
~ ! [X137: $i] :
~ ! [X136: mu] :
~ ~ ! [X135: mu] :
~ ( very_much_likes @ X136 @ X135 @ X137 ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_40]),c_0_24])]) ).
thf(c_0_47,plain,
! [X2: mu,X3: $i,X1: mu,X14: $i] :
( ( very_much_likes @ X1 @ X2 @ X14 )
| ~ ( likes @ X1 @ X2 @ ( esk4_4 @ X3 @ X1 @ X2 @ X14 ) )
| ~ ( likes @ X1 @ X2 @ ( esk3_4 @ X3 @ X1 @ X2 @ X14 ) )
| ~ ( likes @ X1 @ X2 @ X14 )
| ~ ( a3 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
thf(c_0_48,plain,
! [X3: $i] : ( likes @ piotr @ beer @ X3 ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
thf(c_0_49,plain,
! [X3: $i,X14: $i] :
( ( a3 @ X14 @ X3 )
| ~ ( a3 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
thf(c_0_50,plain,
! [X3: $i] : ( a3 @ X3 @ ( esk8_1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
thf(c_0_51,negated_conjecture,
! [X249: mu,X250: mu] :
~ ( very_much_likes @ X249 @ X250 @ esk9_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_46])])])]) ).
thf(c_0_52,plain,
! [X14: $i,X3: $i] :
( ( very_much_likes @ piotr @ beer @ X3 )
| ~ ( a3 @ X14 @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_48]),c_0_48])]) ).
thf(c_0_53,plain,
! [X3: $i] : ( a3 @ ( esk8_1 @ X3 ) @ X3 ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
thf(c_0_54,negated_conjecture,
! [X1: mu,X2: mu] :
~ ( very_much_likes @ X1 @ X2 @ esk9_0 ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
thf(c_0_55,plain,
! [X3: $i] : ( very_much_likes @ piotr @ beer @ X3 ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
thf(c_0_56,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_54,c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : AGT031^1 : TPTP v8.2.0. Bugfixed v5.4.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n007.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Sat May 18 18:49:53 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.35/0.52 Running higher-order theorem proving
% 0.35/0.52 Running: /export/starexec/sandbox/solver/bin/eprover-ho --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
% 0.36/0.56 # Version: 3.1.0-ho
% 0.36/0.56 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.36/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.56 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.36/0.56 # Starting post_as_ho3 with 300s (1) cores
% 0.36/0.56 # Starting new_ho_12 with 300s (1) cores
% 0.36/0.56 # Starting new_bool_2 with 300s (1) cores
% 0.36/0.56 # new_ho_10_cnf2 with pid 29745 completed with status 0
% 0.36/0.56 # Result found by new_ho_10_cnf2
% 0.36/0.56 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.36/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.56 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.36/0.56 # No SInE strategy applied
% 0.36/0.56 # Search class: HGUNM-FFMF32-SHSSMFNN
% 0.36/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.36/0.56 # Starting new_ho_10 with 811s (1) cores
% 0.36/0.56 # Starting new_ho_10_cnf2 with 151s (1) cores
% 0.36/0.56 # Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.36/0.56 # Starting lpo1_def_fix with 136s (1) cores
% 0.36/0.56 # Starting ehoh_best8_lambda with 136s (1) cores
% 0.36/0.56 # ehoh_best_sine_rwall with pid 29752 completed with status 0
% 0.36/0.56 # Result found by ehoh_best_sine_rwall
% 0.36/0.56 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.36/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.56 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.36/0.56 # No SInE strategy applied
% 0.36/0.56 # Search class: HGUNM-FFMF32-SHSSMFNN
% 0.36/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.36/0.56 # Starting new_ho_10 with 811s (1) cores
% 0.36/0.56 # Starting new_ho_10_cnf2 with 151s (1) cores
% 0.36/0.56 # Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.36/0.56 # Preprocessing time : 0.008 s
% 0.36/0.56 # Presaturation interreduction done
% 0.36/0.56
% 0.36/0.56 # Proof found!
% 0.36/0.56 # SZS status Theorem
% 0.36/0.56 # SZS output start CNFRefutation
% See solution above
% 0.36/0.56 # Parsed axioms : 118
% 0.36/0.56 # Removed by relevancy pruning/SinE : 0
% 0.36/0.56 # Initial clauses : 91
% 0.36/0.56 # Removed in clause preprocessing : 45
% 0.36/0.56 # Initial clauses in saturation : 46
% 0.36/0.56 # Processed clauses : 124
% 0.36/0.56 # ...of these trivial : 1
% 0.36/0.56 # ...subsumed : 8
% 0.36/0.56 # ...remaining for further processing : 115
% 0.36/0.56 # Other redundant clauses eliminated : 0
% 0.36/0.56 # Clauses deleted for lack of memory : 0
% 0.36/0.56 # Backward-subsumed : 0
% 0.36/0.56 # Backward-rewritten : 11
% 0.36/0.56 # Generated clauses : 212
% 0.36/0.56 # ...of the previous two non-redundant : 178
% 0.36/0.56 # ...aggressively subsumed : 0
% 0.36/0.56 # Contextual simplify-reflections : 0
% 0.36/0.56 # Paramodulations : 212
% 0.36/0.56 # Factorizations : 0
% 0.36/0.56 # NegExts : 0
% 0.36/0.56 # Equation resolutions : 0
% 0.36/0.56 # Disequality decompositions : 0
% 0.36/0.56 # Total rewrite steps : 61
% 0.36/0.56 # ...of those cached : 34
% 0.36/0.56 # Propositional unsat checks : 0
% 0.36/0.56 # Propositional check models : 0
% 0.36/0.56 # Propositional check unsatisfiable : 0
% 0.36/0.56 # Propositional clauses : 0
% 0.36/0.56 # Propositional clauses after purity: 0
% 0.36/0.56 # Propositional unsat core size : 0
% 0.36/0.56 # Propositional preprocessing time : 0.000
% 0.36/0.56 # Propositional encoding time : 0.000
% 0.36/0.56 # Propositional solver time : 0.000
% 0.36/0.56 # Success case prop preproc time : 0.000
% 0.36/0.56 # Success case prop encoding time : 0.000
% 0.36/0.56 # Success case prop solver time : 0.000
% 0.36/0.56 # Current number of processed clauses : 60
% 0.36/0.56 # Positive orientable unit clauses : 22
% 0.36/0.56 # Positive unorientable unit clauses: 0
% 0.36/0.56 # Negative unit clauses : 1
% 0.36/0.56 # Non-unit-clauses : 37
% 0.36/0.56 # Current number of unprocessed clauses: 125
% 0.36/0.56 # ...number of literals in the above : 273
% 0.36/0.56 # Current number of archived formulas : 0
% 0.36/0.56 # Current number of archived clauses : 55
% 0.36/0.56 # Clause-clause subsumption calls (NU) : 213
% 0.36/0.56 # Rec. Clause-clause subsumption calls : 140
% 0.36/0.56 # Non-unit clause-clause subsumptions : 8
% 0.36/0.56 # Unit Clause-clause subsumption calls : 14
% 0.36/0.56 # Rewrite failures with RHS unbound : 0
% 0.36/0.56 # BW rewrite match attempts : 20
% 0.36/0.56 # BW rewrite match successes : 9
% 0.36/0.56 # Condensation attempts : 0
% 0.36/0.56 # Condensation successes : 0
% 0.36/0.56 # Termbank termtop insertions : 12404
% 0.36/0.56 # Search garbage collected termcells : 3238
% 0.36/0.56
% 0.36/0.56 # -------------------------------------------------
% 0.36/0.56 # User time : 0.017 s
% 0.36/0.56 # System time : 0.011 s
% 0.36/0.56 # Total time : 0.028 s
% 0.36/0.56 # Maximum resident set size: 2524 pages
% 0.36/0.56
% 0.36/0.56 # -------------------------------------------------
% 0.36/0.56 # User time : 0.053 s
% 0.36/0.56 # System time : 0.043 s
% 0.36/0.56 # Total time : 0.096 s
% 0.36/0.56 # Maximum resident set size: 1828 pages
% 0.36/0.56 % E---3.1 exiting
% 0.36/0.57 % E exiting
%------------------------------------------------------------------------------