TSTP Solution File: SWV384+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV384+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 : Sat May 4 09:44:00 EDT 2024
% Result : Theorem 0.22s 0.54s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 38 ( 10 unt; 0 def)
% Number of atoms : 163 ( 0 equ)
% Maximal formula atoms : 42 ( 4 avg)
% Number of connectives : 228 ( 103 ~; 98 |; 11 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 12 con; 0-3 aty)
% Number of variables : 93 ( 0 sgn 51 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l20_induction,axiom,
( ! [X1,X2,X3,X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ( ~ check_cpq(triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6)) )
=> ( ~ check_cpq(im_succ_cpq(triple(X4,X5,X6)))
| ~ ok(im_succ_cpq(triple(X4,X5,X6))) ) ) )
=> ! [X7,X8,X9] :
( ( ~ check_cpq(triple(X7,X8,X9))
| ~ ok(triple(X7,X8,X9)) )
=> ! [X10,X11,X12] :
( succ_cpq(triple(X7,X8,X9),triple(X10,X11,X12))
=> ( ~ ok(triple(X10,X11,X12))
| ~ check_cpq(triple(X10,X11,X12)) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.wc5QcIufZt/E---3.1_22345.p',l20_induction) ).
fof(l20_co,conjecture,
! [X1,X2,X3] :
( ( ~ check_cpq(triple(X1,X2,X3))
| ~ ok(triple(X1,X2,X3)) )
=> ! [X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ~ ok(triple(X4,X5,X6))
| ~ check_cpq(triple(X4,X5,X6)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.wc5QcIufZt/E---3.1_22345.p',l20_co) ).
fof(l12_l13,lemma,
! [X1,X2,X3] :
( ( ~ check_cpq(triple(X1,X2,X3))
| ~ ok(triple(X1,X2,X3)) )
=> ( ~ check_cpq(im_succ_cpq(triple(X1,X2,X3)))
| ~ ok(im_succ_cpq(triple(X1,X2,X3))) ) ),
file('/export/starexec/sandbox/tmp/tmp.wc5QcIufZt/E---3.1_22345.p',l12_l13) ).
fof(c_0_3,plain,
( ! [X1,X2,X3,X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ( ~ check_cpq(triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6)) )
=> ( ~ check_cpq(im_succ_cpq(triple(X4,X5,X6)))
| ~ ok(im_succ_cpq(triple(X4,X5,X6))) ) ) )
=> ! [X7,X8,X9] :
( ( ~ check_cpq(triple(X7,X8,X9))
| ~ ok(triple(X7,X8,X9)) )
=> ! [X10,X11,X12] :
( succ_cpq(triple(X7,X8,X9),triple(X10,X11,X12))
=> ( ~ ok(triple(X10,X11,X12))
| ~ check_cpq(triple(X10,X11,X12)) ) ) ) ),
inference(fof_simplification,[status(thm)],[l20_induction]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( ( ~ check_cpq(triple(X1,X2,X3))
| ~ ok(triple(X1,X2,X3)) )
=> ! [X4,X5,X6] :
( succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
=> ( ~ ok(triple(X4,X5,X6))
| ~ check_cpq(triple(X4,X5,X6)) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l20_co])]) ).
fof(c_0_5,plain,
! [X132,X133,X134,X135,X136,X137] :
( ( check_cpq(triple(X132,X133,X134))
| ~ succ_cpq(triple(X132,X133,X134),triple(X135,X136,X137))
| ~ ok(triple(X135,X136,X137))
| ~ check_cpq(triple(X135,X136,X137))
| succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_0)) )
& ( ok(triple(X132,X133,X134))
| ~ succ_cpq(triple(X132,X133,X134),triple(X135,X136,X137))
| ~ ok(triple(X135,X136,X137))
| ~ check_cpq(triple(X135,X136,X137))
| succ_cpq(triple(esk1_0,esk2_0,esk3_0),triple(esk4_0,esk5_0,esk6_0)) )
& ( check_cpq(triple(X132,X133,X134))
| ~ succ_cpq(triple(X132,X133,X134),triple(X135,X136,X137))
| ~ ok(triple(X135,X136,X137))
| ~ check_cpq(triple(X135,X136,X137))
| ~ check_cpq(triple(esk4_0,esk5_0,esk6_0))
| ~ ok(triple(esk4_0,esk5_0,esk6_0)) )
& ( ok(triple(X132,X133,X134))
| ~ succ_cpq(triple(X132,X133,X134),triple(X135,X136,X137))
| ~ ok(triple(X135,X136,X137))
| ~ check_cpq(triple(X135,X136,X137))
| ~ check_cpq(triple(esk4_0,esk5_0,esk6_0))
| ~ ok(triple(esk4_0,esk5_0,esk6_0)) )
& ( check_cpq(triple(X132,X133,X134))
| ~ succ_cpq(triple(X132,X133,X134),triple(X135,X136,X137))
| ~ ok(triple(X135,X136,X137))
| ~ check_cpq(triple(X135,X136,X137))
| check_cpq(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0))) )
& ( ok(triple(X132,X133,X134))
| ~ succ_cpq(triple(X132,X133,X134),triple(X135,X136,X137))
| ~ ok(triple(X135,X136,X137))
| ~ check_cpq(triple(X135,X136,X137))
| check_cpq(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0))) )
& ( check_cpq(triple(X132,X133,X134))
| ~ succ_cpq(triple(X132,X133,X134),triple(X135,X136,X137))
| ~ ok(triple(X135,X136,X137))
| ~ check_cpq(triple(X135,X136,X137))
| ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0))) )
& ( ok(triple(X132,X133,X134))
| ~ succ_cpq(triple(X132,X133,X134),triple(X135,X136,X137))
| ~ ok(triple(X135,X136,X137))
| ~ check_cpq(triple(X135,X136,X137))
| ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0))) ) ),
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_3])])])])])]) ).
fof(c_0_6,negated_conjecture,
( ( ~ check_cpq(triple(esk7_0,esk8_0,esk9_0))
| ~ ok(triple(esk7_0,esk8_0,esk9_0)) )
& succ_cpq(triple(esk7_0,esk8_0,esk9_0),triple(esk10_0,esk11_0,esk12_0))
& ok(triple(esk10_0,esk11_0,esk12_0))
& check_cpq(triple(esk10_0,esk11_0,esk12_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_7,lemma,
! [X1,X2,X3] :
( ( ~ check_cpq(triple(X1,X2,X3))
| ~ ok(triple(X1,X2,X3)) )
=> ( ~ check_cpq(im_succ_cpq(triple(X1,X2,X3)))
| ~ ok(im_succ_cpq(triple(X1,X2,X3))) ) ),
inference(fof_simplification,[status(thm)],[l12_l13]) ).
cnf(c_0_8,plain,
( ok(triple(X1,X2,X3))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6))
| ~ check_cpq(triple(X4,X5,X6))
| ~ check_cpq(triple(esk4_0,esk5_0,esk6_0))
| ~ ok(triple(esk4_0,esk5_0,esk6_0)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
succ_cpq(triple(esk7_0,esk8_0,esk9_0),triple(esk10_0,esk11_0,esk12_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
ok(triple(esk10_0,esk11_0,esk12_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
check_cpq(triple(esk10_0,esk11_0,esk12_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( check_cpq(triple(X1,X2,X3))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6))
| ~ check_cpq(triple(X4,X5,X6))
| ~ check_cpq(triple(esk4_0,esk5_0,esk6_0))
| ~ ok(triple(esk4_0,esk5_0,esk6_0)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_13,lemma,
! [X138,X139,X140] :
( ( check_cpq(triple(X138,X139,X140))
| ~ check_cpq(im_succ_cpq(triple(X138,X139,X140)))
| ~ ok(im_succ_cpq(triple(X138,X139,X140))) )
& ( ok(triple(X138,X139,X140))
| ~ check_cpq(im_succ_cpq(triple(X138,X139,X140)))
| ~ ok(im_succ_cpq(triple(X138,X139,X140))) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_14,plain,
( check_cpq(triple(X1,X2,X3))
| ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6))
| ~ check_cpq(triple(X4,X5,X6)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( check_cpq(triple(X1,X2,X3))
| check_cpq(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6))
| ~ check_cpq(triple(X4,X5,X6)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
( ~ check_cpq(triple(esk7_0,esk8_0,esk9_0))
| ~ ok(triple(esk7_0,esk8_0,esk9_0)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
( ok(triple(esk7_0,esk8_0,esk9_0))
| ~ ok(triple(esk4_0,esk5_0,esk6_0))
| ~ check_cpq(triple(esk4_0,esk5_0,esk6_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]) ).
cnf(c_0_18,negated_conjecture,
( check_cpq(triple(esk7_0,esk8_0,esk9_0))
| ~ ok(triple(esk4_0,esk5_0,esk6_0))
| ~ check_cpq(triple(esk4_0,esk5_0,esk6_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_9]),c_0_10]),c_0_11])]) ).
cnf(c_0_19,lemma,
( ok(triple(X1,X2,X3))
| ~ check_cpq(im_succ_cpq(triple(X1,X2,X3)))
| ~ ok(im_succ_cpq(triple(X1,X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))
| check_cpq(triple(esk7_0,esk8_0,esk9_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_9]),c_0_10]),c_0_11])]) ).
cnf(c_0_21,negated_conjecture,
( check_cpq(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))
| check_cpq(triple(esk7_0,esk8_0,esk9_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_9]),c_0_10]),c_0_11])]) ).
cnf(c_0_22,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ check_cpq(im_succ_cpq(triple(X1,X2,X3)))
| ~ ok(im_succ_cpq(triple(X1,X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,plain,
( ok(triple(X1,X2,X3))
| ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6))
| ~ check_cpq(triple(X4,X5,X6)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_24,plain,
( ok(triple(X1,X2,X3))
| check_cpq(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))
| ~ succ_cpq(triple(X1,X2,X3),triple(X4,X5,X6))
| ~ ok(triple(X4,X5,X6))
| ~ check_cpq(triple(X4,X5,X6)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_25,negated_conjecture,
( ~ ok(triple(esk4_0,esk5_0,esk6_0))
| ~ check_cpq(triple(esk4_0,esk5_0,esk6_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_26,lemma,
( ok(triple(esk4_0,esk5_0,esk6_0))
| check_cpq(triple(esk7_0,esk8_0,esk9_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_27,lemma,
( check_cpq(triple(esk7_0,esk8_0,esk9_0))
| check_cpq(triple(esk4_0,esk5_0,esk6_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_20]),c_0_21]) ).
cnf(c_0_28,negated_conjecture,
( ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0)))
| ok(triple(esk7_0,esk8_0,esk9_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_9]),c_0_10]),c_0_11])]) ).
cnf(c_0_29,negated_conjecture,
( ok(triple(esk7_0,esk8_0,esk9_0))
| check_cpq(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_9]),c_0_10]),c_0_11])]) ).
cnf(c_0_30,negated_conjecture,
check_cpq(triple(esk7_0,esk8_0,esk9_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_31,lemma,
( ok(triple(esk7_0,esk8_0,esk9_0))
| check_cpq(triple(esk4_0,esk5_0,esk6_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_28]),c_0_29]) ).
cnf(c_0_32,negated_conjecture,
~ ok(triple(esk7_0,esk8_0,esk9_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_30])]) ).
cnf(c_0_33,lemma,
check_cpq(triple(esk4_0,esk5_0,esk6_0)),
inference(sr,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,negated_conjecture,
ok(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0))),
inference(sr,[status(thm)],[c_0_28,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
check_cpq(im_succ_cpq(triple(esk4_0,esk5_0,esk6_0))),
inference(sr,[status(thm)],[c_0_29,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
~ ok(triple(esk4_0,esk5_0,esk6_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_33])]) ).
cnf(c_0_37,lemma,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_34]),c_0_35])]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWV384+1 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n013.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 16:30:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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/tmp/tmp.wc5QcIufZt/E---3.1_22345.p
% 0.22/0.54 # Version: 3.1.0
% 0.22/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.54 # Starting sh5l with 300s (1) cores
% 0.22/0.54 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 22424 completed with status 0
% 0.22/0.54 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.22/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.54 # No SInE strategy applied
% 0.22/0.54 # Search class: FGHSM-FFMS31-MFFFFFNN
% 0.22/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.54 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 647s (1) cores
% 0.22/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.22/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.22/0.54 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 136s (1) cores
% 0.22/0.54 # Starting G-E--_301_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.22/0.54 # G-E--_301_C18_F1_URBAN_S0Y with pid 22434 completed with status 0
% 0.22/0.54 # Result found by G-E--_301_C18_F1_URBAN_S0Y
% 0.22/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.54 # No SInE strategy applied
% 0.22/0.54 # Search class: FGHSM-FFMS31-MFFFFFNN
% 0.22/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.54 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 647s (1) cores
% 0.22/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.22/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.22/0.54 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 136s (1) cores
% 0.22/0.54 # Starting G-E--_301_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.22/0.54 # Preprocessing time : 0.003 s
% 0.22/0.54
% 0.22/0.54 # Proof found!
% 0.22/0.54 # SZS status Theorem
% 0.22/0.54 # SZS output start CNFRefutation
% See solution above
% 0.22/0.54 # Parsed axioms : 44
% 0.22/0.54 # Removed by relevancy pruning/SinE : 0
% 0.22/0.54 # Initial clauses : 66
% 0.22/0.54 # Removed in clause preprocessing : 4
% 0.22/0.54 # Initial clauses in saturation : 62
% 0.22/0.54 # Processed clauses : 135
% 0.22/0.54 # ...of these trivial : 1
% 0.22/0.54 # ...subsumed : 8
% 0.22/0.54 # ...remaining for further processing : 126
% 0.22/0.54 # Other redundant clauses eliminated : 3
% 0.22/0.54 # Clauses deleted for lack of memory : 0
% 0.22/0.54 # Backward-subsumed : 7
% 0.22/0.54 # Backward-rewritten : 24
% 0.22/0.54 # Generated clauses : 349
% 0.22/0.54 # ...of the previous two non-redundant : 319
% 0.22/0.54 # ...aggressively subsumed : 0
% 0.22/0.54 # Contextual simplify-reflections : 8
% 0.22/0.54 # Paramodulations : 341
% 0.22/0.54 # Factorizations : 2
% 0.22/0.54 # NegExts : 0
% 0.22/0.54 # Equation resolutions : 3
% 0.22/0.54 # Disequality decompositions : 0
% 0.22/0.54 # Total rewrite steps : 109
% 0.22/0.54 # ...of those cached : 85
% 0.22/0.54 # Propositional unsat checks : 0
% 0.22/0.54 # Propositional check models : 0
% 0.22/0.54 # Propositional check unsatisfiable : 0
% 0.22/0.54 # Propositional clauses : 0
% 0.22/0.54 # Propositional clauses after purity: 0
% 0.22/0.54 # Propositional unsat core size : 0
% 0.22/0.54 # Propositional preprocessing time : 0.000
% 0.22/0.54 # Propositional encoding time : 0.000
% 0.22/0.54 # Propositional solver time : 0.000
% 0.22/0.54 # Success case prop preproc time : 0.000
% 0.22/0.54 # Success case prop encoding time : 0.000
% 0.22/0.54 # Success case prop solver time : 0.000
% 0.22/0.54 # Current number of processed clauses : 89
% 0.22/0.54 # Positive orientable unit clauses : 27
% 0.22/0.54 # Positive unorientable unit clauses: 0
% 0.22/0.54 # Negative unit clauses : 8
% 0.22/0.54 # Non-unit-clauses : 54
% 0.22/0.54 # Current number of unprocessed clauses: 235
% 0.22/0.54 # ...number of literals in the above : 1070
% 0.22/0.54 # Current number of archived formulas : 0
% 0.22/0.54 # Current number of archived clauses : 37
% 0.22/0.54 # Clause-clause subsumption calls (NU) : 1131
% 0.22/0.54 # Rec. Clause-clause subsumption calls : 422
% 0.22/0.54 # Non-unit clause-clause subsumptions : 18
% 0.22/0.54 # Unit Clause-clause subsumption calls : 153
% 0.22/0.54 # Rewrite failures with RHS unbound : 0
% 0.22/0.54 # BW rewrite match attempts : 20
% 0.22/0.54 # BW rewrite match successes : 6
% 0.22/0.54 # Condensation attempts : 0
% 0.22/0.54 # Condensation successes : 0
% 0.22/0.54 # Termbank termtop insertions : 11353
% 0.22/0.54 # Search garbage collected termcells : 770
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.020 s
% 0.22/0.54 # System time : 0.003 s
% 0.22/0.54 # Total time : 0.023 s
% 0.22/0.54 # Maximum resident set size: 1968 pages
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.083 s
% 0.22/0.54 # System time : 0.016 s
% 0.22/0.54 # Total time : 0.099 s
% 0.22/0.54 # Maximum resident set size: 1748 pages
% 0.22/0.54 % E---3.1 exiting
% 0.22/0.54 % E exiting
%------------------------------------------------------------------------------