%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV396+1 : TPTP v9.2.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n027.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 5 05:22:05 PM UTC 2026
% Result : Theorem 1.93s 1.90s
% Output : CNFRefutation 1.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 14
% Syntax : Number of formulae : 75 ( 20 unt; 0 def)
% Number of atoms : 197 ( 62 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 187 ( 65 ~; 77 |; 26 &)
% ( 5 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 5 usr; 2 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-3 aty)
% Number of variables : 199 ( 23 sgn 125 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax40,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax40) ).
fof(l32_co,conjecture,
! [X1] :
( ! [X2,X3,X4,X5] :
( ( pair_in_list(X1,X4,X5)
& strictly_less_than(X4,X5)
& ok(remove_cpq(triple(X2,X1,X3),X4)) )
=> pair_in_list(remove_slb(X1,X4),X4,X5) )
=> ! [X6,X7,X8,X9,X10,X11] :
( ( pair_in_list(insert_slb(X1,pair(X10,X11)),X8,X9)
& strictly_less_than(X8,X9)
& ok(remove_cpq(triple(X6,insert_slb(X1,pair(X10,X11)),X7),X8)) )
=> pair_in_list(remove_slb(insert_slb(X1,pair(X10,X11)),X8),X8,X9) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l32_co) ).
fof(ax43,axiom,
! [X1,X2,X3,X4] :
( ~ contains_slb(X2,X4)
=> remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax43) ).
fof(ax45,axiom,
! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& strictly_less_than(X4,lookup_slb(X2,X4)) )
=> remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax45) ).
fof(ax21,axiom,
! [X1,X2,X3,X4] :
( contains_slb(insert_slb(X1,pair(X2,X4)),X3)
<=> ( contains_slb(X1,X3)
| X2 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax21) ).
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(ax41,axiom,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax41) ).
fof(ax27,axiom,
! [X1,X2,X3,X4] :
( ( X2 != X3
& contains_slb(X1,X3) )
=> lookup_slb(insert_slb(X1,pair(X2,X4)),X3) = lookup_slb(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax27) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(ax44,axiom,
! [X1,X2,X3,X4] :
( ( contains_slb(X2,X4)
& less_than(lookup_slb(X2,X4),X4) )
=> remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax44) ).
fof(ax25,axiom,
! [X1,X2,X3,X4] :
( ( X2 != X3
& contains_slb(X1,X3) )
=> remove_slb(insert_slb(X1,pair(X2,X4)),X3) = insert_slb(remove_slb(X1,X3),pair(X2,X4)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax25) ).
fof(ax23,axiom,
! [X1,X2,X3,X4,X5] :
( pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5)
<=> ( pair_in_list(X1,X3,X5)
| ( X2 = X3
& X4 = X5 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax23) ).
fof(ax24,axiom,
! [X1,X2,X3] : remove_slb(insert_slb(X1,pair(X2,X3)),X2) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax24) ).
fof(ax26,axiom,
! [X1,X2,X3] : lookup_slb(insert_slb(X1,pair(X2,X3)),X2) = X3,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax26) ).
fof(c_0_14,plain,
! [X1,X2] : ~ ok(triple(X1,X2,bad)),
inference(fof_simplification,[status(thm)],[ax40]) ).
fof(c_0_15,negated_conjecture,
~ ! [X1] :
( ! [X2,X3,X4,X5] :
( ( pair_in_list(X1,X4,X5)
& strictly_less_than(X4,X5)
& ok(remove_cpq(triple(X2,X1,X3),X4)) )
=> pair_in_list(remove_slb(X1,X4),X4,X5) )
=> ! [X6,X7,X8,X9,X10,X11] :
( ( pair_in_list(insert_slb(X1,pair(X10,X11)),X8,X9)
& strictly_less_than(X8,X9)
& ok(remove_cpq(triple(X6,insert_slb(X1,pair(X10,X11)),X7),X8)) )
=> pair_in_list(remove_slb(insert_slb(X1,pair(X10,X11)),X8),X8,X9) ) ),
inference(assume_negation,[status(cth)],[l32_co]) ).
fof(c_0_16,plain,
! [X1,X2,X3,X4] :
( ~ contains_slb(X2,X4)
=> remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad) ),
inference(fof_simplification,[status(thm)],[ax43]) ).
fof(c_0_17,plain,
! [X214,X215] : ~ ok(triple(X214,X215,bad)),
inference(variable_rename,[status(thm)],[c_0_14]) ).
fof(c_0_18,plain,
! [X231,X232,X233,X234] :
( ~ contains_slb(X232,X234)
| ~ strictly_less_than(X234,lookup_slb(X232,X234))
| remove_cpq(triple(X231,X232,X233),X234) = triple(remove_pqp(X231,X234),remove_slb(X232,X234),bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])]) ).
fof(c_0_19,negated_conjecture,
! [X254,X255,X256,X257] :
( ( ~ pair_in_list(esk1_0,X256,X257)
| ~ strictly_less_than(X256,X257)
| ~ ok(remove_cpq(triple(X254,esk1_0,X255),X256))
| pair_in_list(remove_slb(esk1_0,X256),X256,X257) )
& pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0,esk5_0)
& strictly_less_than(esk4_0,esk5_0)
& ok(remove_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk3_0),esk4_0))
& ~ pair_in_list(remove_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0),esk4_0,esk5_0) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
fof(c_0_20,plain,
! [X223,X224,X225,X226] :
( contains_slb(X224,X226)
| remove_cpq(triple(X223,X224,X225),X226) = triple(X223,X224,bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])]) ).
cnf(c_0_21,plain,
~ ok(triple(X1,X2,bad)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( remove_cpq(triple(X3,X1,X4),X2) = triple(remove_pqp(X3,X2),remove_slb(X1,X2),bad)
| ~ contains_slb(X1,X2)
| ~ strictly_less_than(X2,lookup_slb(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
ok(remove_cpq(triple(esk2_0,insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk3_0),esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
( contains_slb(X1,X2)
| remove_cpq(triple(X3,X1,X4),X2) = triple(X3,X1,bad) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_25,plain,
! [X153,X154,X155,X156] :
( ( ~ contains_slb(insert_slb(X153,pair(X154,X156)),X155)
| contains_slb(X153,X155)
| X154 = X155 )
& ( ~ contains_slb(X153,X155)
| contains_slb(insert_slb(X153,pair(X154,X156)),X155) )
& ( X154 != X155
| contains_slb(insert_slb(X153,pair(X154,X156)),X155) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])])]) ).
fof(c_0_26,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[stricly_smaller_definition]) ).
fof(c_0_27,plain,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
inference(fof_simplification,[status(thm)],[ax41]) ).
cnf(c_0_28,plain,
( ~ ok(remove_cpq(triple(X1,X2,X3),X4))
| ~ contains_slb(X2,X4)
| ~ strictly_less_than(X4,lookup_slb(X2,X4)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
contains_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21]) ).
fof(c_0_30,plain,
! [X174,X175,X176,X177] :
( X175 = X176
| ~ contains_slb(X174,X176)
| lookup_slb(insert_slb(X174,pair(X175,X177)),X176) = lookup_slb(X174,X176) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])]) ).
cnf(c_0_31,plain,
( contains_slb(X1,X4)
| X2 = X4
| ~ contains_slb(insert_slb(X1,pair(X2,X3)),X4) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_32,plain,
! [X146,X147] :
( ( less_than(X146,X147)
| ~ strictly_less_than(X146,X147) )
& ( ~ less_than(X147,X146)
| ~ strictly_less_than(X146,X147) )
& ( ~ less_than(X146,X147)
| less_than(X147,X146)
| strictly_less_than(X146,X147) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])]) ).
fof(c_0_33,plain,
! [X143,X144] :
( less_than(X143,X144)
| less_than(X144,X143) ),
inference(variable_rename,[status(thm)],[totality]) ).
fof(c_0_34,plain,
! [X216,X217,X218] :
( ok(triple(X216,X217,X218))
| X218 = bad ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])]) ).
fof(c_0_35,plain,
! [X227,X228,X229,X230] :
( ~ contains_slb(X228,X230)
| ~ less_than(lookup_slb(X228,X230),X230)
| remove_cpq(triple(X227,X228,X229),X230) = triple(remove_pqp(X227,X230),remove_slb(X228,X230),X229) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax44])]) ).
cnf(c_0_36,negated_conjecture,
~ strictly_less_than(esk4_0,lookup_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_23]),c_0_29])]) ).
cnf(c_0_37,plain,
( X1 = X2
| lookup_slb(insert_slb(X3,pair(X1,X4)),X2) = lookup_slb(X3,X2)
| ~ contains_slb(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,negated_conjecture,
( esk6_0 = esk4_0
| contains_slb(esk1_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_29]) ).
cnf(c_0_39,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_41,plain,
( ok(triple(X1,X2,X3))
| X3 = bad ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_42,plain,
( remove_cpq(triple(X3,X1,X4),X2) = triple(remove_pqp(X3,X2),remove_slb(X1,X2),X4)
| ~ contains_slb(X1,X2)
| ~ less_than(lookup_slb(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_43,negated_conjecture,
( esk6_0 = esk4_0
| ~ strictly_less_than(esk4_0,lookup_slb(esk1_0,esk4_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_44,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_39,c_0_40]) ).
fof(c_0_45,plain,
! [X167,X168,X169,X170] :
( X168 = X169
| ~ contains_slb(X167,X169)
| remove_slb(insert_slb(X167,pair(X168,X170)),X169) = insert_slb(remove_slb(X167,X169),pair(X168,X170)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax25])]) ).
cnf(c_0_46,plain,
( X1 = bad
| ok(remove_cpq(triple(X2,X3,X1),X4))
| ~ contains_slb(X3,X4)
| ~ less_than(lookup_slb(X3,X4),X4) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,negated_conjecture,
( esk6_0 = esk4_0
| less_than(lookup_slb(esk1_0,esk4_0),esk4_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
fof(c_0_48,plain,
! [X159,X160,X161,X162,X163] :
( ( X160 = X161
| pair_in_list(X159,X161,X163)
| ~ pair_in_list(insert_slb(X159,pair(X160,X162)),X161,X163) )
& ( X162 = X163
| pair_in_list(X159,X161,X163)
| ~ pair_in_list(insert_slb(X159,pair(X160,X162)),X161,X163) )
& ( ~ pair_in_list(X159,X161,X163)
| pair_in_list(insert_slb(X159,pair(X160,X162)),X161,X163) )
& ( X160 != X161
| X162 != X163
| pair_in_list(insert_slb(X159,pair(X160,X162)),X161,X163) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])]) ).
cnf(c_0_49,negated_conjecture,
~ pair_in_list(remove_slb(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0),esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_50,plain,
( X1 = X2
| remove_slb(insert_slb(X3,pair(X1,X4)),X2) = insert_slb(remove_slb(X3,X2),pair(X1,X4))
| ~ contains_slb(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_51,negated_conjecture,
( pair_in_list(remove_slb(esk1_0,X1),X1,X2)
| ~ pair_in_list(esk1_0,X1,X2)
| ~ strictly_less_than(X1,X2)
| ~ ok(remove_cpq(triple(X3,esk1_0,X4),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_52,negated_conjecture,
( esk6_0 = esk4_0
| X1 = bad
| ok(remove_cpq(triple(X2,esk1_0,X1),esk4_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_38]) ).
cnf(c_0_53,plain,
( X1 = X2
| pair_in_list(X3,X2,X4)
| ~ pair_in_list(insert_slb(X3,pair(X1,X5)),X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_54,negated_conjecture,
pair_in_list(insert_slb(esk1_0,pair(esk6_0,esk7_0)),esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_55,negated_conjecture,
( esk6_0 = esk4_0
| ~ pair_in_list(insert_slb(remove_slb(esk1_0,esk4_0),pair(esk6_0,esk7_0)),esk4_0,esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_38]) ).
cnf(c_0_56,plain,
( pair_in_list(insert_slb(X1,pair(X4,X5)),X2,X3)
| ~ pair_in_list(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_57,negated_conjecture,
( esk6_0 = esk4_0
| X1 = bad
| pair_in_list(remove_slb(esk1_0,esk4_0),esk4_0,X2)
| ~ pair_in_list(esk1_0,esk4_0,X2)
| ~ strictly_less_than(esk4_0,X2) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_58,negated_conjecture,
( esk6_0 = esk4_0
| pair_in_list(esk1_0,esk4_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_59,negated_conjecture,
strictly_less_than(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_60,negated_conjecture,
( esk6_0 = esk4_0
| ~ pair_in_list(remove_slb(esk1_0,esk4_0),esk4_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_61,negated_conjecture,
( esk6_0 = esk4_0
| X1 = bad ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]),c_0_60]) ).
cnf(c_0_62,negated_conjecture,
( esk6_0 = esk4_0
| ~ ok(bad) ),
inference(spm,[status(thm)],[c_0_21,c_0_61]) ).
cnf(c_0_63,negated_conjecture,
( esk6_0 = esk4_0
| ~ ok(X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_61]) ).
fof(c_0_64,plain,
! [X164,X165,X166] : remove_slb(insert_slb(X164,pair(X165,X166)),X165) = X164,
inference(variable_rename,[status(thm)],[ax24]) ).
fof(c_0_65,plain,
! [X171,X172,X173] : lookup_slb(insert_slb(X171,pair(X172,X173)),X172) = X173,
inference(variable_rename,[status(thm)],[ax26]) ).
cnf(c_0_66,plain,
( X1 = X2
| pair_in_list(X3,X4,X2)
| ~ pair_in_list(insert_slb(X3,pair(X5,X1)),X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_67,negated_conjecture,
esk6_0 = esk4_0,
inference(spm,[status(thm)],[c_0_63,c_0_23]) ).
cnf(c_0_68,plain,
remove_slb(insert_slb(X1,pair(X2,X3)),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_69,plain,
lookup_slb(insert_slb(X1,pair(X2,X3)),X2) = X3,
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_70,negated_conjecture,
( esk7_0 = esk5_0
| pair_in_list(esk1_0,esk4_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_66,c_0_54]) ).
cnf(c_0_71,negated_conjecture,
~ pair_in_list(esk1_0,esk4_0,esk5_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_67]),c_0_68]) ).
cnf(c_0_72,negated_conjecture,
~ strictly_less_than(esk4_0,esk7_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_67]),c_0_69]) ).
cnf(c_0_73,negated_conjecture,
esk7_0 = esk5_0,
inference(sr,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_74,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73]),c_0_59])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SWV396+1 : TPTP v9.2.1. Released v3.3.0.
% 0.13/0.14 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.17/0.35 % Computer : n027.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Tue May 5 05:07:35 EDT 2026
% 0.17/0.35 % CPUTime :
% 0.17/0.36 % start to proof: theBenchmark
% 1.93/1.90 % Version : CSE_E---1.7
% 1.93/1.90 % Problem : theBenchmark.p
% 1.93/1.90 % SZS status Theorem for theBenchmark.p
% 1.93/1.90 % SZS output start CNFRefutation
% See solution above
% 1.93/1.90 % Total time : 1.372s
%------------------------------------------------------------------------------