TSTP Solution File: PLA054^4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PLA054^4 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 : Tue May 21 02:19:23 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 32
% Syntax : Number of formulae : 64 ( 21 unt; 20 typ; 0 def)
% Number of atoms : 181 ( 14 equ; 0 cnn)
% Maximal formula atoms : 25 ( 4 avg)
% Number of connectives : 458 ( 55 ~; 49 |; 18 &; 312 @)
% ( 1 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 7 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 65 ( 65 >; 0 *; 0 +; 0 <<)
% Number of symbols : 21 ( 19 usr; 5 con; 0-3 aty)
% Number of variables : 112 ( 35 ^ 71 !; 6 ?; 112 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mworld: $tType ).
thf(decl_22,type,
mrel: mworld > mworld > $o ).
thf(decl_23,type,
mactual: mworld ).
thf(decl_24,type,
mlocal: ( mworld > $o ) > $o ).
thf(decl_25,type,
mnot: ( mworld > $o ) > mworld > $o ).
thf(decl_26,type,
mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_28,type,
mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_30,type,
mbox: ( mworld > $o ) > mworld > $o ).
thf(decl_32,type,
mforall_di: ( $i > mworld > $o ) > mworld > $o ).
thf(decl_33,type,
mexists_di: ( $i > mworld > $o ) > mworld > $o ).
thf(decl_34,type,
d: $i ).
thf(decl_36,type,
o: $i ).
thf(decl_37,type,
h: $i > mworld > $o ).
thf(decl_38,type,
closed: $i > mworld > $o ).
thf(decl_39,type,
combo: $i > $i > mworld > $o ).
thf(decl_40,type,
open: $i > mworld > $o ).
thf(decl_41,type,
epred1_1: mworld > $o ).
thf(decl_43,type,
esk2_0: mworld ).
thf(decl_44,type,
esk3_2: $i > $i > mworld ).
thf(decl_45,type,
esk4_3: mworld > $i > $i > $i ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mlocal_def) ).
thf(mand_def,axiom,
( mand
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
& ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mand_def) ).
thf(mimplies_def,axiom,
( mimplies
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
=> ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mimplies_def) ).
thf(mbox_def,axiom,
( mbox
= ( ^ [X1: mworld > $o,X3: mworld] :
! [X5: mworld] :
( ( mrel @ X3 @ X5 )
=> ( X1 @ X5 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mbox_def) ).
thf(mexists_di_def,axiom,
( mexists_di
= ( ^ [X9: $i > mworld > $o,X3: mworld] :
? [X8: $i] : ( X9 @ X8 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mexists_di_def) ).
thf(con,conjecture,
( mlocal
@ ( mbox
@ ( mexists_di
@ ^ [X14: $i] :
( mexists_di
@ ^ [X12: $i] : ( mimplies @ ( mbox @ ( mand @ ( combo @ d @ X14 ) @ ( h @ X12 ) ) ) @ ( mbox @ ( open @ d ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
thf(ax2,axiom,
mlocal @ ( mbox @ ( closed @ d ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).
thf(mnot_def,axiom,
( mnot
= ( ^ [X2: mworld > $o,X3: mworld] :
~ ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mnot_def) ).
thf(mforall_di_def,axiom,
( mforall_di
= ( ^ [X7: $i > mworld > $o,X3: mworld] :
! [X8: $i] : ( X7 @ X8 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mforall_di_def) ).
thf(mrel_reflexive,axiom,
! [X3: mworld] : ( mrel @ X3 @ X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_reflexive) ).
thf(ax1,axiom,
( mlocal
@ ( mbox
@ ( mforall_di
@ ^ [X10: $i] :
( mforall_di
@ ^ [X11: $i] :
( mexists_di
@ ^ [X12: $i] : ( mand @ ( mbox @ ( mimplies @ ( mand @ ( closed @ X10 ) @ ( mand @ ( combo @ X10 @ X11 ) @ ( h @ X12 ) ) ) @ ( mbox @ ( open @ X10 ) ) ) ) @ ( mbox @ ( mimplies @ ( mand @ ( closed @ X10 ) @ ( mand @ ( mnot @ ( combo @ X10 @ X11 ) ) @ ( h @ o ) ) ) @ ( mbox @ ( closed @ X10 ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
thf(c_0_11,plain,
! [X26: mworld] :
( ( epred1_1 @ X26 )
<=> ! [X25: $i,X24: $i] :
? [X23: $i] :
( ! [X20: mworld] :
( ( mrel @ X26 @ X20 )
=> ( ( ( closed @ X25 @ X20 )
& ( combo @ X25 @ X24 @ X20 )
& ( h @ X23 @ X20 ) )
=> ! [X19: mworld] :
( ( mrel @ X20 @ X19 )
=> ( open @ X25 @ X19 ) ) ) )
& ! [X22: mworld] :
( ( mrel @ X26 @ X22 )
=> ( ( ( closed @ X25 @ X22 )
& ~ ( combo @ X25 @ X24 @ X22 )
& ( h @ o @ X22 ) )
=> ! [X21: mworld] :
( ( mrel @ X22 @ X21 )
=> ( closed @ X25 @ X21 ) ) ) ) ) ),
introduced(definition) ).
thf(c_0_12,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_def]) ).
thf(c_0_13,plain,
( mand
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand_def]) ).
thf(c_0_14,plain,
( mimplies
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies_def]) ).
thf(c_0_15,plain,
( mbox
= ( ^ [Z0: mworld > $o,Z1: mworld] :
! [X5: mworld] :
( ( mrel @ Z1 @ X5 )
=> ( Z0 @ X5 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_def]) ).
thf(c_0_16,plain,
( mexists_di
= ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
? [X8: $i] : ( Z0 @ X8 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mexists_di_def]) ).
thf(c_0_17,plain,
! [X26: mworld] :
( ( epred1_1 @ X26 )
=> ! [X25: $i,X24: $i] :
? [X23: $i] :
( ! [X20: mworld] :
( ( mrel @ X26 @ X20 )
=> ( ( ( closed @ X25 @ X20 )
& ( combo @ X25 @ X24 @ X20 )
& ( h @ X23 @ X20 ) )
=> ! [X19: mworld] :
( ( mrel @ X20 @ X19 )
=> ( open @ X25 @ X19 ) ) ) )
& ! [X22: mworld] :
( ( mrel @ X26 @ X22 )
=> ( ( ( closed @ X25 @ X22 )
& ~ ( combo @ X25 @ X24 @ X22 )
& ( h @ o @ X22 ) )
=> ! [X21: mworld] :
( ( mrel @ X22 @ X21 )
=> ( closed @ X25 @ X21 ) ) ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_11]) ).
thf(c_0_18,negated_conjecture,
~ ! [X37: mworld] :
( ( mrel @ mactual @ X37 )
=> ? [X36: $i,X35: $i] :
( ! [X33: mworld] :
( ( mrel @ X37 @ X33 )
=> ( ( combo @ d @ X36 @ X33 )
& ( h @ X35 @ X33 ) ) )
=> ! [X34: mworld] :
( ( mrel @ X37 @ X34 )
=> ( open @ d @ X34 ) ) ) ),
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)],[inference(assume_negation,[status(cth)],[con])]),c_0_12]),c_0_13]),c_0_14]),c_0_15]),c_0_16]) ).
thf(c_0_19,plain,
! [X54: mworld,X55: $i,X56: $i,X58: mworld,X59: mworld,X60: $i,X61: $i,X62: mworld,X63: mworld] :
( ( ~ ( mrel @ X54 @ X58 )
| ~ ( closed @ X55 @ X58 )
| ~ ( combo @ X55 @ X56 @ X58 )
| ~ ( h @ ( esk4_3 @ X54 @ X55 @ X56 ) @ X58 )
| ~ ( mrel @ X58 @ X59 )
| ( open @ X55 @ X59 )
| ~ ( epred1_1 @ X54 ) )
& ( ~ ( mrel @ X54 @ X62 )
| ~ ( closed @ X60 @ X62 )
| ( combo @ X60 @ X61 @ X62 )
| ~ ( h @ o @ X62 )
| ~ ( mrel @ X62 @ X63 )
| ( closed @ X60 @ X63 )
| ~ ( epred1_1 @ X54 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])])])])]) ).
thf(c_0_20,negated_conjecture,
! [X50: $i,X51: $i,X52: mworld] :
( ( mrel @ mactual @ esk2_0 )
& ( ( combo @ d @ X50 @ X52 )
| ~ ( mrel @ esk2_0 @ X52 ) )
& ( ( h @ X51 @ X52 )
| ~ ( mrel @ esk2_0 @ X52 ) )
& ( mrel @ esk2_0 @ ( esk3_2 @ X50 @ X51 ) )
& ~ ( open @ d @ ( esk3_2 @ X50 @ X51 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])])]) ).
thf(c_0_21,plain,
! [X10: $i,X8: $i,X6: mworld,X5: mworld,X3: mworld] :
( ( open @ X8 @ X6 )
| ~ ( mrel @ X3 @ X5 )
| ~ ( closed @ X8 @ X5 )
| ~ ( combo @ X8 @ X10 @ X5 )
| ~ ( h @ ( esk4_3 @ X3 @ X8 @ X10 ) @ X5 )
| ~ ( mrel @ X5 @ X6 )
| ~ ( epred1_1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_22,negated_conjecture,
! [X8: $i,X3: mworld] :
( ( h @ X8 @ X3 )
| ~ ( mrel @ esk2_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_23,plain,
! [X27: mworld] :
( ( mrel @ mactual @ X27 )
=> ( closed @ d @ X27 ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[ax2,c_0_12]),c_0_15]) ).
thf(c_0_24,negated_conjecture,
! [X10: $i,X8: $i,X3: mworld,X5: mworld,X6: mworld] :
( ( open @ X8 @ X3 )
| ~ ( combo @ X8 @ X10 @ X5 )
| ~ ( mrel @ esk2_0 @ X5 )
| ~ ( closed @ X8 @ X5 )
| ~ ( mrel @ X5 @ X3 )
| ~ ( mrel @ X6 @ X5 )
| ~ ( epred1_1 @ X6 ) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_25,negated_conjecture,
! [X8: $i,X3: mworld] :
( ( combo @ d @ X8 @ X3 )
| ~ ( mrel @ esk2_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_26,plain,
! [X43: mworld] :
( ~ ( mrel @ mactual @ X43 )
| ( closed @ d @ X43 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).
thf(c_0_27,plain,
( mnot
= ( ^ [Z0: mworld > $o,Z1: mworld] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot_def]) ).
thf(c_0_28,plain,
( mforall_di
= ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
! [X8: $i] : ( Z0 @ X8 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_di_def]) ).
thf(c_0_29,negated_conjecture,
! [X3: mworld,X5: mworld,X6: mworld] :
( ( open @ d @ X3 )
| ~ ( mrel @ esk2_0 @ X5 )
| ~ ( closed @ d @ X5 )
| ~ ( mrel @ X5 @ X3 )
| ~ ( mrel @ X6 @ X5 )
| ~ ( epred1_1 @ X6 ) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
thf(c_0_30,plain,
! [X3: mworld] :
( ( closed @ d @ X3 )
| ~ ( mrel @ mactual @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_31,plain,
! [X38: mworld] : ( mrel @ X38 @ X38 ),
inference(variable_rename,[status(thm)],[mrel_reflexive]) ).
thf(c_0_32,plain,
! [X26: mworld] :
( ( mrel @ mactual @ X26 )
=> ( epred1_1 @ X26 ) ),
inference(apply_def,[status(thm)],[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(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[ax1]),c_0_12]),c_0_27]),c_0_13]),c_0_14]),c_0_15]),c_0_28]),c_0_16])]),c_0_11]) ).
thf(c_0_33,negated_conjecture,
! [X3: mworld,X5: mworld,X6: mworld] :
( ( open @ d @ X3 )
| ~ ( mrel @ esk2_0 @ X5 )
| ~ ( mrel @ mactual @ X5 )
| ~ ( mrel @ X5 @ X3 )
| ~ ( mrel @ X6 @ X5 )
| ~ ( epred1_1 @ X6 ) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
thf(c_0_34,plain,
! [X3: mworld] : ( mrel @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_35,negated_conjecture,
mrel @ mactual @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_36,plain,
! [X42: mworld] :
( ~ ( mrel @ mactual @ X42 )
| ( epred1_1 @ X42 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])]) ).
thf(c_0_37,negated_conjecture,
! [X3: mworld,X5: mworld] :
( ( open @ d @ X3 )
| ~ ( mrel @ esk2_0 @ X3 )
| ~ ( mrel @ X5 @ esk2_0 )
| ~ ( epred1_1 @ X5 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
thf(c_0_38,plain,
! [X3: mworld] :
( ( epred1_1 @ X3 )
| ~ ( mrel @ mactual @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
thf(c_0_39,negated_conjecture,
! [X3: mworld,X5: mworld] :
( ( open @ d @ X3 )
| ~ ( mrel @ esk2_0 @ X3 )
| ~ ( mrel @ X5 @ esk2_0 )
| ~ ( mrel @ mactual @ X5 ) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
thf(c_0_40,negated_conjecture,
! [X8: $i,X10: $i] :
~ ( open @ d @ ( esk3_2 @ X8 @ X10 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_41,negated_conjecture,
! [X3: mworld] :
( ( open @ d @ X3 )
| ~ ( mrel @ esk2_0 @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_35]),c_0_34])]) ).
thf(c_0_42,negated_conjecture,
! [X8: $i,X10: $i] : ( mrel @ esk2_0 @ ( esk3_2 @ X8 @ X10 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PLA054^4 : TPTP v8.2.0. Released v8.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat May 18 13:40:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 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.20/0.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.49 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.49 # Starting almost_fo_3_lam with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.49 # ho_unfolding_3 with pid 26378 completed with status 0
% 0.20/0.49 # Result found by ho_unfolding_3
% 0.20/0.49 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGHNS-FFSF32-SHSSMFNN
% 0.20/0.49 # partial match(2): HGHNF-FFSF22-SHSSMFNN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting new_ho_10 with 811s (1) cores
% 0.20/0.49 # Starting ho_unfolding_3 with 151s (1) cores
% 0.20/0.49 # Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.20/0.49 # Starting lpo1_def_fix with 136s (1) cores
% 0.20/0.49 # Starting ehoh_best8_lambda with 136s (1) cores
% 0.20/0.49 # lpo1_def_fix with pid 26386 completed with status 0
% 0.20/0.49 # Result found by lpo1_def_fix
% 0.20/0.49 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGHNS-FFSF32-SHSSMFNN
% 0.20/0.49 # partial match(2): HGHNF-FFSF22-SHSSMFNN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting new_ho_10 with 811s (1) cores
% 0.20/0.49 # Starting ho_unfolding_3 with 151s (1) cores
% 0.20/0.49 # Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.20/0.49 # Starting lpo1_def_fix with 136s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 38
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 34
% 0.20/0.49 # Removed in clause preprocessing : 21
% 0.20/0.49 # Initial clauses in saturation : 13
% 0.20/0.49 # Processed clauses : 43
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 4
% 0.20/0.49 # ...remaining for further processing : 39
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 2
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 33
% 0.20/0.49 # ...of the previous two non-redundant : 30
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 33
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 7
% 0.20/0.49 # ...of those cached : 3
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 24
% 0.20/0.49 # Positive orientable unit clauses : 3
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 1
% 0.20/0.49 # Non-unit-clauses : 20
% 0.20/0.49 # Current number of unprocessed clauses: 12
% 0.20/0.49 # ...number of literals in the above : 66
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 15
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 128
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 64
% 0.20/0.49 # Non-unit clause-clause subsumptions : 6
% 0.20/0.49 # Unit Clause-clause subsumption calls : 0
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 2
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 3927
% 0.20/0.49 # Search garbage collected termcells : 1249
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.008 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.012 s
% 0.20/0.49 # Maximum resident set size: 2000 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.024 s
% 0.20/0.49 # System time : 0.010 s
% 0.20/0.49 # Total time : 0.034 s
% 0.20/0.49 # Maximum resident set size: 1788 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------