TSTP Solution File: SYN735-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN735-1 : TPTP v8.1.2. Released v2.5.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 20:18:28 EDT 2023
% Result : Satisfiable 0.20s 0.50s
% Output : Saturation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause19)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_21,negated_conjecture,
( ssPv4(X3)
| ssPv2(X4)
| ~ ssRr(X1,X2)
| ~ ssPv3(X2)
| ~ ssRr(X1,X3)
| ~ ssRr(X1,X4)
| ~ ssPv4(X1) ),
clause19,
[final] ).
cnf(c_0_22,negated_conjecture,
ssRr(X1,skf1(X1)),
clause1,
[final] ).
cnf(c_0_23,negated_conjecture,
( ssPv1(X3)
| ssPv2(X1)
| ~ ssRr(X1,X2)
| ~ ssPv3(X2)
| ~ ssRr(X1,X3)
| ~ ssPv4(X1) ),
clause10,
[final] ).
cnf(c_0_24,negated_conjecture,
( ssPv3(X2)
| ssPv2(X3)
| ssPv1(X1)
| ssPv3(X1)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3) ),
clause4,
[final] ).
cnf(c_0_25,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv4(X2)
| ~ ssPv4(X1)
| ~ ssPv3(X3)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]),
[final] ).
cnf(c_0_26,negated_conjecture,
( ssPv4(X2)
| ssPv2(X3)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3)
| ~ ssPv1(X1)
| ~ ssPv4(X1) ),
clause9,
[final] ).
cnf(c_0_27,negated_conjecture,
( ssPv3(X3)
| ssPv2(X4)
| ~ ssRr(X1,X2)
| ~ ssPv1(X2)
| ~ ssRr(X1,X3)
| ~ ssRr(X1,X4)
| ~ ssPv2(X1) ),
clause16,
[final] ).
cnf(c_0_28,negated_conjecture,
( ssPv4(X3)
| ssPv3(X4)
| ssPv2(X1)
| ~ ssRr(X1,X2)
| ~ ssPv2(X2)
| ~ ssRr(X1,X3)
| ~ ssRr(X1,X4) ),
clause14,
[final] ).
cnf(c_0_29,negated_conjecture,
( ssPv3(X3)
| ssPv1(X4)
| ~ ssRr(X1,X2)
| ~ ssPv4(X2)
| ~ ssRr(X1,X3)
| ~ ssRr(X1,X4)
| ~ ssPv3(X1) ),
clause15,
[final] ).
cnf(c_0_30,negated_conjecture,
( ssPv2(X1)
| ssPv1(skf1(X1))
| ~ ssPv4(X1)
| ~ ssPv3(X2)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_22]),
[final] ).
cnf(c_0_31,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv3(X1)
| ssPv3(X2)
| ssPv1(X1)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_22]),
[final] ).
cnf(c_0_32,negated_conjecture,
( ssPv1(X2)
| ssPv1(X1)
| ssPv3(X1)
| ssPv4(X1)
| ~ ssRr(X1,X2) ),
clause2,
[final] ).
cnf(c_0_33,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv4(skf1(X1))
| ~ ssPv4(X1)
| ~ ssPv3(X2)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_22]),
[final] ).
cnf(c_0_34,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv4(X2)
| ~ ssPv4(X1)
| ~ ssPv1(X1)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_22]),
[final] ).
cnf(c_0_35,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv3(X2)
| ~ ssPv2(X1)
| ~ ssPv1(X3)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3) ),
inference(spm,[status(thm)],[c_0_27,c_0_22]),
[final] ).
cnf(c_0_36,negated_conjecture,
( ssPv2(X1)
| ssPv4(X2)
| ssPv3(skf1(X1))
| ~ ssPv2(X3)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3) ),
inference(spm,[status(thm)],[c_0_28,c_0_22]),
[final] ).
cnf(c_0_37,negated_conjecture,
( ssPv3(X1)
| ssPv1(skf1(X2))
| ~ ssPv4(X3)
| ~ ssPv3(X2)
| ~ ssRr(X2,X1)
| ~ ssRr(X2,X3) ),
inference(spm,[status(thm)],[c_0_29,c_0_22]),
[final] ).
cnf(c_0_38,negated_conjecture,
( ssPv2(X1)
| ssPv1(skf1(X1))
| ~ ssPv4(X1)
| ~ ssPv3(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_30,c_0_22]),
[final] ).
cnf(c_0_39,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv3(skf1(X1))
| ssPv3(X1)
| ssPv1(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_22]),
[final] ).
cnf(c_0_40,negated_conjecture,
( ssPv4(X1)
| ssPv3(X1)
| ssPv1(skf1(X1))
| ssPv1(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_22]),
[final] ).
cnf(c_0_41,negated_conjecture,
( ssPv3(X4)
| ssPv2(X1)
| ~ ssRr(X1,X2)
| ~ ssPv3(X2)
| ~ ssRr(X1,X3)
| ~ ssPv2(X3)
| ~ ssRr(X1,X4) ),
clause18,
[final] ).
cnf(c_0_42,negated_conjecture,
( ssPv2(X4)
| ssPv1(X1)
| ~ ssRr(X1,X2)
| ~ ssPv4(X2)
| ~ ssRr(X1,X3)
| ~ ssPv1(X3)
| ~ ssRr(X1,X4) ),
clause20,
[final] ).
cnf(c_0_43,negated_conjecture,
( ssPv2(X4)
| ssPv3(X1)
| ~ ssRr(X1,X2)
| ~ ssPv3(X2)
| ~ ssRr(X1,X3)
| ~ ssPv1(X3)
| ~ ssRr(X1,X4) ),
clause17,
[final] ).
cnf(c_0_44,negated_conjecture,
( ssPv4(X2)
| ssPv2(X3)
| ssPv2(X1)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3)
| ~ ssPv1(X1) ),
clause5,
[final] ).
cnf(c_0_45,negated_conjecture,
( ssPv4(X2)
| ssPv3(X3)
| ssPv1(X1)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3)
| ~ ssPv2(X1) ),
clause7,
[final] ).
cnf(c_0_46,negated_conjecture,
( ssPv2(X4)
| ~ ssRr(X1,X2)
| ~ ssPv3(X2)
| ~ ssRr(X1,X3)
| ~ ssPv1(X3)
| ~ ssRr(X1,X4)
| ~ ssPv1(X1) ),
clause21,
[final] ).
cnf(c_0_47,negated_conjecture,
( ssPv4(X2)
| ssPv3(X3)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3)
| ~ ssPv1(X1)
| ~ ssPv4(X1) ),
clause8,
[final] ).
cnf(c_0_48,negated_conjecture,
( ssPv2(X3)
| ssPv2(X1)
| ssPv3(X1)
| ~ ssRr(X1,X2)
| ~ ssPv4(X2)
| ~ ssRr(X1,X3) ),
clause6,
[final] ).
cnf(c_0_49,negated_conjecture,
( ssPv3(X1)
| ~ ssRr(X1,X2)
| ~ ssPv2(X2)
| ~ ssPv2(X1)
| ~ ssPv4(X1) ),
clause3,
[final] ).
cnf(c_0_50,negated_conjecture,
( ssPv3(X3)
| ssPv2(X1)
| ~ ssRr(X1,X2)
| ~ ssPv1(X2)
| ~ ssRr(X1,X3)
| ~ ssPv3(X1) ),
clause11,
[final] ).
cnf(c_0_51,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv4(skf1(X1))
| ~ ssPv4(X1)
| ~ ssPv3(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_22]),
[final] ).
cnf(c_0_52,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv4(skf1(X1))
| ~ ssPv4(X1)
| ~ ssPv1(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_22]),
[final] ).
cnf(c_0_53,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv3(skf1(X1))
| ~ ssPv2(X1)
| ~ ssPv1(X2)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_22]),
[final] ).
cnf(c_0_54,negated_conjecture,
( ssPv2(X1)
| ssPv4(skf1(X1))
| ssPv3(skf1(X1))
| ~ ssPv2(X2)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_22]),
[final] ).
cnf(c_0_55,negated_conjecture,
( ssPv3(skf1(X1))
| ssPv1(skf1(X1))
| ~ ssPv4(X2)
| ~ ssPv3(X1)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_22]),
[final] ).
cnf(c_0_56,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv2(X1)
| ssPv3(X1)
| ssPv1(skf1(X1))
| ssPv1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),
[final] ).
cnf(c_0_57,negated_conjecture,
( ssPv2(X1)
| ssPv3(skf1(X1))
| ~ ssPv2(X2)
| ~ ssPv3(X3)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3) ),
inference(spm,[status(thm)],[c_0_41,c_0_22]),
[final] ).
cnf(c_0_58,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv1(X1)
| ~ ssPv4(X2)
| ~ ssPv1(X3)
| ~ ssRr(X1,X3)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_22]),
[final] ).
cnf(c_0_59,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv3(X1)
| ~ ssPv3(X2)
| ~ ssPv1(X3)
| ~ ssRr(X1,X3)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_22]),
[final] ).
cnf(c_0_60,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv2(X1)
| ssPv4(X2)
| ~ ssPv1(X1)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_22]),
[final] ).
cnf(c_0_61,negated_conjecture,
( ssPv4(X1)
| ssPv3(skf1(X2))
| ssPv1(X2)
| ~ ssPv2(X2)
| ~ ssRr(X2,X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_22]),
[final] ).
cnf(c_0_62,negated_conjecture,
( ssPv2(skf1(X1))
| ~ ssPv3(X2)
| ~ ssPv1(X3)
| ~ ssPv1(X1)
| ~ ssRr(X1,X3)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_22]),
[final] ).
cnf(c_0_63,negated_conjecture,
( ssPv4(X1)
| ssPv3(skf1(X2))
| ~ ssPv4(X2)
| ~ ssPv1(X2)
| ~ ssRr(X2,X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_22]),
[final] ).
cnf(c_0_64,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv2(X1)
| ssPv3(X1)
| ~ ssPv4(X2)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_22]),
[final] ).
cnf(c_0_65,negated_conjecture,
( ssPv3(X1)
| ~ ssPv2(skf1(X1))
| ~ ssPv2(X1)
| ~ ssPv4(X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_22]),
[final] ).
cnf(c_0_66,negated_conjecture,
( ssPv2(X1)
| ssPv3(skf1(X1))
| ~ ssPv3(X1)
| ~ ssPv1(X2)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_22]),
[final] ).
cnf(c_0_67,negated_conjecture,
( ssPv2(X1)
| ssPv3(X1)
| ~ ssRr(X1,X2)
| ~ ssPv4(X2)
| ~ ssRr(X1,X3)
| ~ ssPv1(X3) ),
clause12,
[final] ).
cnf(c_0_68,negated_conjecture,
( ssPv3(X3)
| ~ ssRr(X1,X2)
| ~ ssPv3(X2)
| ~ ssRr(X1,X3)
| ~ ssPv1(X1)
| ~ ssPv4(X1) ),
clause13,
[final] ).
cnf(c_0_69,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv4(skf1(X1))
| ssPv3(X1)
| ~ ssPv4(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_39]),c_0_52]),
[final] ).
cnf(c_0_70,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv4(skf1(X1))
| ssPv1(skf1(skf1(X1)))
| ssPv1(skf1(X1))
| ~ ssPv4(X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_40]),
[final] ).
cnf(c_0_71,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv3(skf1(X1))
| ~ ssPv2(X1)
| ~ ssPv1(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_53,c_0_22]),
[final] ).
cnf(c_0_72,negated_conjecture,
( ssPv2(X1)
| ssPv4(skf1(X1))
| ssPv3(skf1(X1))
| ~ ssPv2(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_54,c_0_22]),
[final] ).
cnf(c_0_73,negated_conjecture,
( ssPv3(skf1(X1))
| ssPv1(skf1(X1))
| ~ ssPv4(skf1(X1))
| ~ ssPv3(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_22]),
[final] ).
cnf(c_0_74,negated_conjecture,
( ssPv2(skf1(skf1(X1)))
| ssPv2(skf1(X1))
| ssPv2(X1)
| ssPv1(skf1(skf1(X1)))
| ssPv1(skf1(X1))
| ~ ssPv4(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_56]),
[final] ).
cnf(c_0_75,negated_conjecture,
( ssPv2(X1)
| ssPv3(skf1(X1))
| ~ ssPv2(skf1(X1))
| ~ ssPv3(X2)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_57,c_0_22]),
[final] ).
cnf(c_0_76,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv1(X1)
| ~ ssPv4(X2)
| ~ ssPv1(skf1(X1))
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_58,c_0_22]),
[final] ).
cnf(c_0_77,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv3(X1)
| ~ ssPv3(X2)
| ~ ssPv1(skf1(X1))
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_59,c_0_22]),
[final] ).
cnf(c_0_78,negated_conjecture,
( ssPv2(X1)
| ssPv3(X2)
| ssPv1(X2)
| ~ ssRr(X2,X1)
| ~ ssRr(X2,X2) ),
inference(ef,[status(thm)],[c_0_24]),
[final] ).
cnf(c_0_79,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv2(X1)
| ssPv4(skf1(X1))
| ~ ssPv1(X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_22]),
[final] ).
cnf(c_0_80,negated_conjecture,
( ssPv4(skf1(X1))
| ssPv3(skf1(X1))
| ssPv1(X1)
| ~ ssPv2(X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_22]),
[final] ).
cnf(c_0_81,negated_conjecture,
( ssPv2(skf1(X1))
| ~ ssPv3(X2)
| ~ ssPv1(skf1(X1))
| ~ ssPv1(X1)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_62,c_0_22]),
[final] ).
cnf(c_0_82,negated_conjecture,
( ssPv2(X1)
| ssPv4(X2)
| ~ ssPv1(X1)
| ~ ssRr(X1,X1)
| ~ ssRr(X1,X2) ),
inference(ef,[status(thm)],[c_0_44]),
[final] ).
cnf(c_0_83,negated_conjecture,
( ssPv4(skf1(X1))
| ssPv3(skf1(X1))
| ~ ssPv4(X1)
| ~ ssPv1(X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_22]),
[final] ).
cnf(c_0_84,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv3(X1)
| ssPv1(X1)
| ~ ssRr(X1,X1) ),
inference(ef,[status(thm)],[c_0_31]),
[final] ).
cnf(c_0_85,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv2(X1)
| ssPv3(X1)
| ~ ssPv4(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_64,c_0_22]),
[final] ).
cnf(c_0_86,negated_conjecture,
( ssPv2(X1)
| ssPv4(skf1(X1))
| ssPv1(skf1(skf1(X1)))
| ssPv1(skf1(X1))
| ~ ssPv4(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_40]),
[final] ).
cnf(c_0_87,negated_conjecture,
( ssPv2(X1)
| ssPv1(skf1(X1))
| ~ ssPv2(skf1(skf1(X1)))
| ~ ssPv2(skf1(X1))
| ~ ssPv4(skf1(X1))
| ~ ssPv4(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_65]),
[final] ).
cnf(c_0_88,negated_conjecture,
( ssPv2(X1)
| ssPv3(skf1(X1))
| ~ ssPv3(X1)
| ~ ssPv1(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_66,c_0_22]),
[final] ).
cnf(c_0_89,negated_conjecture,
( ssPv2(X1)
| ssPv3(X1)
| ~ ssPv4(X2)
| ~ ssPv1(skf1(X1))
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_67,c_0_22]),
[final] ).
cnf(c_0_90,negated_conjecture,
( ssPv3(skf1(X1))
| ~ ssPv4(X1)
| ~ ssPv3(X2)
| ~ ssPv1(X1)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_68,c_0_22]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN735-1 : TPTP v8.1.2. Released v2.5.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 19:13:36 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.gJS7I53rHv/E---3.1_16275.p
% 0.20/0.50 # Version: 3.1pre001
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # new_bool_3 with pid 16354 completed with status 1
% 0.20/0.50 # Result found by new_bool_3
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGUNF-FFMF11-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 181s (1) cores
% 0.20/0.50 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 16359 completed with status 1
% 0.20/0.50 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGUNF-FFMF11-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 181s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # No proof found!
% 0.20/0.50 # SZS status Satisfiable
% 0.20/0.50 # SZS output start Saturation
% See solution above
% 0.20/0.50 # Parsed axioms : 21
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 21
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 21
% 0.20/0.50 # Processed clauses : 96
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 5
% 0.20/0.50 # ...remaining for further processing : 91
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 56
% 0.20/0.50 # ...of the previous two non-redundant : 54
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 2
% 0.20/0.50 # Paramodulations : 50
% 0.20/0.50 # Factorizations : 6
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Total rewrite steps : 0
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 70
% 0.20/0.50 # Positive orientable unit clauses : 1
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 0
% 0.20/0.50 # Non-unit-clauses : 69
% 0.20/0.50 # Current number of unprocessed clauses: 0
% 0.20/0.50 # ...number of literals in the above : 0
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 21
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 61
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 24
% 0.20/0.50 # Non-unit clause-clause subsumptions : 7
% 0.20/0.50 # Unit Clause-clause subsumption calls : 0
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 0
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 3114
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.008 s
% 0.20/0.50 # System time : 0.002 s
% 0.20/0.50 # Total time : 0.010 s
% 0.20/0.50 # Maximum resident set size: 1616 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.010 s
% 0.20/0.50 # System time : 0.004 s
% 0.20/0.50 # Total time : 0.014 s
% 0.20/0.50 # Maximum resident set size: 1732 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------