TSTP Solution File: SET664+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET664+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:20:10 EDT 2023
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 61 ( 15 unt; 0 def)
% Number of atoms : 210 ( 19 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 250 ( 101 ~; 95 |; 17 &)
% ( 4 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 96 ( 8 sgn; 49 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(p21,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ( empty(X1)
<=> ! [X2] :
( ilf_type(X2,set_type)
=> ~ member(X2,X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.7MlNbwTkl1/E---3.1_3831.p',p21) ).
fof(p3,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,relation_type(X1,X2))
=> ( subset(domain_of(X3),X1)
& subset(range_of(X3),X2) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.7MlNbwTkl1/E---3.1_3831.p',p3) ).
fof(p33,axiom,
! [X1] : ilf_type(X1,set_type),
file('/export/starexec/sandbox/tmp/tmp.7MlNbwTkl1/E---3.1_3831.p',p33) ).
fof(prove_relset_1_27,conjecture,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,relation_type(X2,X1))
=> ( ilf_type(X3,relation_type(X2,empty_set))
=> X3 = empty_set ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.7MlNbwTkl1/E---3.1_3831.p',prove_relset_1_27) ).
fof(p4,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ~ member(X1,empty_set) ),
file('/export/starexec/sandbox/tmp/tmp.7MlNbwTkl1/E---3.1_3831.p',p4) ).
fof(p19,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( subset(X1,X2)
<=> ! [X3] :
( ilf_type(X3,set_type)
=> ( member(X3,X1)
=> member(X3,X2) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.7MlNbwTkl1/E---3.1_3831.p',p19) ).
fof(p1,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ( subset(X1,empty_set)
=> X1 = empty_set ) ),
file('/export/starexec/sandbox/tmp/tmp.7MlNbwTkl1/E---3.1_3831.p',p1) ).
fof(p6,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( ! [X3] :
( ilf_type(X3,subset_type(cross_product(X1,X2)))
=> ilf_type(X3,relation_type(X1,X2)) )
& ! [X4] :
( ilf_type(X4,relation_type(X1,X2))
=> ilf_type(X4,subset_type(cross_product(X1,X2))) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.7MlNbwTkl1/E---3.1_3831.p',p6) ).
fof(p13,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ( ilf_type(X1,binary_relation_type)
<=> ( relation_like(X1)
& ilf_type(X1,set_type) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.7MlNbwTkl1/E---3.1_3831.p',p13) ).
fof(p28,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,subset_type(cross_product(X1,X2)))
=> relation_like(X3) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.7MlNbwTkl1/E---3.1_3831.p',p28) ).
fof(p2,axiom,
! [X1] :
( ilf_type(X1,binary_relation_type)
=> ( ( domain_of(X1) = empty_set
| range_of(X1) = empty_set )
=> X1 = empty_set ) ),
file('/export/starexec/sandbox/tmp/tmp.7MlNbwTkl1/E---3.1_3831.p',p2) ).
fof(c_0_11,plain,
! [X1] :
( ilf_type(X1,set_type)
=> ( empty(X1)
<=> ! [X2] :
( ilf_type(X2,set_type)
=> ~ member(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[p21]) ).
fof(c_0_12,plain,
! [X7,X8,X9] :
( ( subset(domain_of(X9),X7)
| ~ ilf_type(X9,relation_type(X7,X8))
| ~ ilf_type(X8,set_type)
| ~ ilf_type(X7,set_type) )
& ( subset(range_of(X9),X8)
| ~ ilf_type(X9,relation_type(X7,X8))
| ~ ilf_type(X8,set_type)
| ~ ilf_type(X7,set_type) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p3])])])]) ).
fof(c_0_13,plain,
! [X79] : ilf_type(X79,set_type),
inference(variable_rename,[status(thm)],[p33]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,relation_type(X2,X1))
=> ( ilf_type(X3,relation_type(X2,empty_set))
=> X3 = empty_set ) ) ) ),
inference(assume_negation,[status(cth)],[prove_relset_1_27]) ).
fof(c_0_15,plain,
! [X1] :
( ilf_type(X1,set_type)
=> ~ member(X1,empty_set) ),
inference(fof_simplification,[status(thm)],[p4]) ).
fof(c_0_16,plain,
! [X44,X45] :
( ( ~ empty(X44)
| ~ ilf_type(X45,set_type)
| ~ member(X45,X44)
| ~ ilf_type(X44,set_type) )
& ( ilf_type(esk7_1(X44),set_type)
| empty(X44)
| ~ ilf_type(X44,set_type) )
& ( member(esk7_1(X44),X44)
| empty(X44)
| ~ ilf_type(X44,set_type) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])]) ).
fof(c_0_17,plain,
! [X39,X40,X41] :
( ( ~ subset(X39,X40)
| ~ ilf_type(X41,set_type)
| ~ member(X41,X39)
| member(X41,X40)
| ~ ilf_type(X40,set_type)
| ~ ilf_type(X39,set_type) )
& ( ilf_type(esk6_2(X39,X40),set_type)
| subset(X39,X40)
| ~ ilf_type(X40,set_type)
| ~ ilf_type(X39,set_type) )
& ( member(esk6_2(X39,X40),X39)
| subset(X39,X40)
| ~ ilf_type(X40,set_type)
| ~ ilf_type(X39,set_type) )
& ( ~ member(esk6_2(X39,X40),X40)
| subset(X39,X40)
| ~ ilf_type(X40,set_type)
| ~ ilf_type(X39,set_type) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p19])])])])]) ).
cnf(c_0_18,plain,
( subset(range_of(X1),X2)
| ~ ilf_type(X1,relation_type(X3,X2))
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X3,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
ilf_type(X1,set_type),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,negated_conjecture,
( ilf_type(esk13_0,set_type)
& ilf_type(esk14_0,set_type)
& ilf_type(esk15_0,relation_type(esk14_0,esk13_0))
& ilf_type(esk15_0,relation_type(esk14_0,empty_set))
& esk15_0 != empty_set ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
fof(c_0_21,plain,
! [X10] :
( ~ ilf_type(X10,set_type)
| ~ member(X10,empty_set) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])]) ).
fof(c_0_22,plain,
! [X5] :
( ~ ilf_type(X5,set_type)
| ~ subset(X5,empty_set)
| X5 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])]) ).
cnf(c_0_23,plain,
( ~ empty(X1)
| ~ ilf_type(X2,set_type)
| ~ member(X2,X1)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( member(esk6_2(X1,X2),X1)
| subset(X1,X2)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ ilf_type(X3,set_type)
| ~ member(X3,X1)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
( subset(range_of(X1),X2)
| ~ ilf_type(X1,relation_type(X3,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_19])]) ).
cnf(c_0_27,negated_conjecture,
ilf_type(esk15_0,relation_type(esk14_0,empty_set)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( ~ ilf_type(X1,set_type)
| ~ member(X1,empty_set) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_29,plain,
! [X11,X12,X13,X14] :
( ( ~ ilf_type(X13,subset_type(cross_product(X11,X12)))
| ilf_type(X13,relation_type(X11,X12))
| ~ ilf_type(X12,set_type)
| ~ ilf_type(X11,set_type) )
& ( ~ ilf_type(X14,relation_type(X11,X12))
| ilf_type(X14,subset_type(cross_product(X11,X12)))
| ~ ilf_type(X12,set_type)
| ~ ilf_type(X11,set_type) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p6])])])]) ).
cnf(c_0_30,plain,
( X1 = empty_set
| ~ ilf_type(X1,set_type)
| ~ subset(X1,empty_set) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
( ~ empty(X1)
| ~ member(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_19]),c_0_19])]) ).
cnf(c_0_32,plain,
( member(esk6_2(X1,X2),X1)
| subset(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_19]),c_0_19])]) ).
cnf(c_0_33,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_19]),c_0_19]),c_0_19])]) ).
cnf(c_0_34,negated_conjecture,
subset(range_of(esk15_0),empty_set),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,plain,
~ member(X1,empty_set),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_19])]) ).
cnf(c_0_36,plain,
( member(esk7_1(X1),X1)
| empty(X1)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_37,plain,
! [X30] :
( ( relation_like(X30)
| ~ ilf_type(X30,binary_relation_type)
| ~ ilf_type(X30,set_type) )
& ( ilf_type(X30,set_type)
| ~ ilf_type(X30,binary_relation_type)
| ~ ilf_type(X30,set_type) )
& ( ~ relation_like(X30)
| ~ ilf_type(X30,set_type)
| ilf_type(X30,binary_relation_type)
| ~ ilf_type(X30,set_type) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p13])])]) ).
fof(c_0_38,plain,
! [X64,X65,X66] :
( ~ ilf_type(X64,set_type)
| ~ ilf_type(X65,set_type)
| ~ ilf_type(X66,subset_type(cross_product(X64,X65)))
| relation_like(X66) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p28])])]) ).
cnf(c_0_39,plain,
( ilf_type(X1,subset_type(cross_product(X2,X3)))
| ~ ilf_type(X1,relation_type(X2,X3))
| ~ ilf_type(X3,set_type)
| ~ ilf_type(X2,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_40,plain,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_19])]) ).
cnf(c_0_41,plain,
( subset(X1,X2)
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_42,negated_conjecture,
~ member(X1,range_of(esk15_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_43,plain,
( empty(X1)
| member(esk7_1(X1),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_19])]) ).
cnf(c_0_44,plain,
( ilf_type(X1,binary_relation_type)
| ~ relation_like(X1)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_45,plain,
( relation_like(X3)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X3,subset_type(cross_product(X1,X2))) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_46,plain,
( ilf_type(X1,subset_type(cross_product(X2,X3)))
| ~ ilf_type(X1,relation_type(X2,X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_19]),c_0_19])]) ).
cnf(c_0_47,negated_conjecture,
ilf_type(esk15_0,relation_type(esk14_0,esk13_0)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_48,plain,
! [X6] :
( ( domain_of(X6) != empty_set
| X6 = empty_set
| ~ ilf_type(X6,binary_relation_type) )
& ( range_of(X6) != empty_set
| X6 = empty_set
| ~ ilf_type(X6,binary_relation_type) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p2])])]) ).
cnf(c_0_49,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_50,negated_conjecture,
empty(range_of(esk15_0)),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_51,plain,
( ilf_type(X1,binary_relation_type)
| ~ relation_like(X1)
| ~ ilf_type(X1,set_type) ),
inference(cn,[status(thm)],[c_0_44]) ).
cnf(c_0_52,plain,
( relation_like(X1)
| ~ ilf_type(X1,subset_type(cross_product(X2,X3))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_19]),c_0_19])]) ).
cnf(c_0_53,negated_conjecture,
ilf_type(esk15_0,subset_type(cross_product(esk14_0,esk13_0))),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_54,plain,
( X1 = empty_set
| range_of(X1) != empty_set
| ~ ilf_type(X1,binary_relation_type) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_55,negated_conjecture,
range_of(esk15_0) = empty_set,
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_56,negated_conjecture,
esk15_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_57,plain,
( ilf_type(X1,binary_relation_type)
| ~ relation_like(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_19])]) ).
cnf(c_0_58,negated_conjecture,
relation_like(esk15_0),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_59,negated_conjecture,
~ ilf_type(esk15_0,binary_relation_type),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SET664+3 : TPTP v8.1.2. Released v2.2.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n016.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.31 % CPULimit : 2400
% 0.16/0.31 % WCLimit : 300
% 0.16/0.31 % DateTime : Mon Oct 2 17:35:06 EDT 2023
% 0.16/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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.7MlNbwTkl1/E---3.1_3831.p
% 0.16/0.44 # Version: 3.1pre001
% 0.16/0.44 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3909 completed with status 0
% 0.16/0.44 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.16/0.44 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: FGHSF-FFMM31-SFFFFFNN
% 0.16/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 811s (1) cores
% 0.16/0.44 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/0.44 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.44 # Starting U----_212g_01_C10_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.44 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3917 completed with status 0
% 0.16/0.44 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.16/0.44 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: FGHSF-FFMM31-SFFFFFNN
% 0.16/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 811s (1) cores
% 0.16/0.44 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/0.44 # Preprocessing time : 0.002 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Theorem
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 35
% 0.16/0.44 # Removed by relevancy pruning/SinE : 0
% 0.16/0.44 # Initial clauses : 65
% 0.16/0.44 # Removed in clause preprocessing : 5
% 0.16/0.44 # Initial clauses in saturation : 60
% 0.16/0.44 # Processed clauses : 139
% 0.16/0.44 # ...of these trivial : 15
% 0.16/0.44 # ...subsumed : 4
% 0.16/0.44 # ...remaining for further processing : 120
% 0.16/0.44 # Other redundant clauses eliminated : 0
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 0
% 0.16/0.44 # Backward-rewritten : 11
% 0.16/0.44 # Generated clauses : 85
% 0.16/0.44 # ...of the previous two non-redundant : 80
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 1
% 0.16/0.44 # Paramodulations : 85
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 0
% 0.16/0.44 # Total rewrite steps : 109
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 64
% 0.16/0.44 # Positive orientable unit clauses : 22
% 0.16/0.44 # Positive unorientable unit clauses: 0
% 0.16/0.44 # Negative unit clauses : 4
% 0.16/0.44 # Non-unit-clauses : 38
% 0.16/0.44 # Current number of unprocessed clauses: 44
% 0.16/0.44 # ...number of literals in the above : 77
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 56
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 353
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 181
% 0.16/0.44 # Non-unit clause-clause subsumptions : 2
% 0.16/0.44 # Unit Clause-clause subsumption calls : 139
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 4
% 0.16/0.44 # BW rewrite match successes : 4
% 0.16/0.44 # Condensation attempts : 0
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 6092
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.010 s
% 0.16/0.44 # System time : 0.003 s
% 0.16/0.44 # Total time : 0.013 s
% 0.16/0.44 # Maximum resident set size: 1912 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.038 s
% 0.16/0.44 # System time : 0.010 s
% 0.16/0.44 # Total time : 0.048 s
% 0.16/0.44 # Maximum resident set size: 1732 pages
% 0.16/0.44 % E---3.1 exiting
% 0.16/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------