0.00/0.04	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.06	% Command  : run_SATResetCoP /export/starexec/sandbox2/benchmark/theBenchmark.p 180
0.15/0.42	% Computer : n006.cluster.edu
0.15/0.42	% Model    : x86_64 x86_64
0.15/0.42	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.15/0.42	% Memory   : 8046.5625MB
0.15/0.42	% OS       : Linux 6.8.0-71-generic
0.15/0.42	% CPULimit : 1440
0.15/0.42	% WCLimit  : 180
0.15/0.42	% DateTime : Mon Jul 27 08:56:06 UTC 2026
0.15/0.42	% CPUTime  : 
0.15/0.42	Running run_SATResetCoP /export/starexec/sandbox2/benchmark/theBenchmark.p 180
2.90/3.19	% SZS status Theorem for theBenchmark
2.90/3.19	% SZS output start CNFRefutation for theBenchmark
2.90/3.19	fof(satresetcop_input_1,axiom,
2.90/3.19	    ! [X,Y,Z] :
2.90/3.19	      ( less(X,Z)
2.90/3.19	     <= ( less(X,Y)
2.90/3.19	        & leq(Y,Z) ) ),
2.90/3.19	    file('Axioms/MGT002+0.ax',less_leq_trans)).
2.90/3.19	fof(satresetcop_input_2,axiom,
2.90/3.19	    ! [X,Y,Z] :
2.90/3.19	      ( less(X,Z)
2.90/3.19	     <= ( less(Y,Z)
2.90/3.19	        & less(X,Y) ) ),
2.90/3.19	    file('Axioms/MGT002+0.ax',transitive)).
2.90/3.19	fof(satresetcop_input_3,axiom,
2.90/3.19	    ! [X,Y] :
2.90/3.19	      ( less(X,Y)
2.90/3.19	      | Y = X
2.90/3.19	      | less(Y,X) ),
2.90/3.19	    file('Axioms/MGT002+0.ax',trichotomy)).
2.90/3.19	fof(satresetcop_input_4,axiom,
2.90/3.19	    ! [X,Y] :
2.90/3.19	      ( leq(X,Y)
2.90/3.19	    <=> ( less(X,Y)
2.90/3.19	        | X = Y ) ),
2.90/3.19	    file('Axioms/MGT002+0.ax',leq_def)).
2.90/3.19	fof(satresetcop_input_5,axiom,
2.90/3.19	    ! [X,Y,Z] :
2.90/3.19	      ( ( leq(X,Y)
2.90/3.19	        & leq(Y,Z) )
2.90/3.19	     => leq(X,Z) ),
2.90/3.19	    file('Axioms/MGT002+0.ax',leq_trans)).
2.90/3.19	fof(satresetcop_input_6,axiom,
2.90/3.19	    ! [X,Y,Z] :
2.90/3.19	      ( ( less(Y,Z)
2.90/3.19	        & leq(X,Y) )
2.90/3.19	     => less(X,Z) ),
2.90/3.19	    file('Axioms/MGT002+0.ax',leq_less_trans)).
2.90/3.19	fof(satresetcop_input_7,axiom,
2.90/3.19	    ! [X,Y] :
2.90/3.19	      ( ( leq(Y,X)
2.90/3.19	        & leq(X,Y) )
2.90/3.19	     => Y = X ),
2.90/3.19	    file('Axioms/MGT002+0.ax',leq_antisym)).
2.90/3.19	fof(satresetcop_input_8,axiom,
2.90/3.19	    ! [X] : ~ less(X,X),
2.90/3.19	    file('Axioms/MGT002+0.ax',irreflexive)).
2.90/3.19	fof(satresetcop_input_9,axiom,
2.90/3.19	    ! [X,Y] :
2.90/3.19	      ( less(X,Y)
2.90/3.19	     => leq(X,Y) ),
2.90/3.19	    file('Axioms/MGT002+0.ax',less_implies_leq)).
2.90/3.19	fof(satresetcop_input_10,axiom,
2.90/3.19	    is_verdict(compatible),
2.90/3.19	    file('Axioms/MGT002+2.ax',compatible_is_verdict)).
2.90/3.19	fof(satresetcop_input_11,axiom,
2.90/3.19	    is_verdict(unknown),
2.90/3.19	    file('Axioms/MGT002+2.ax',unknown_is_verdict)).
2.90/3.19	fof(satresetcop_input_12,axiom,
2.90/3.19	    ! [V1,V2] :
2.90/3.19	      ( ( is_verdict(V1)
2.90/3.19	        & is_verdict(V2)
2.90/3.19	        & ( V2 = conflict
2.90/3.19	          | conflict = V1 ) )
2.90/3.19	     => conflict = box_verdict(V1,V2) ),
2.90/3.19	    file('Axioms/MGT002+2.ax',box_conflict)).
2.90/3.19	fof(satresetcop_input_13,axiom,
2.90/3.19	    ! [I1lo,I1hi,I2lo,I2hi] :
2.90/3.19	      ( axis_subsumes(I1lo,I1hi,I2lo,I2hi)
2.90/3.19	    <=> ! [X] :
2.90/3.19	          ( in_closed(X,I2lo,I2hi)
2.90/3.19	         <= in_closed(X,I1lo,I1hi) ) ),
2.90/3.19	    file('Axioms/MGT002+2.ax',axis_subsumes_def)).
2.90/3.19	fof(satresetcop_input_14,axiom,
2.90/3.19	    ! [X,A,B] :
2.90/3.19	      ( in_lopen(X,A,B)
2.90/3.19	    <=> ( leq(X,B)
2.90/3.19	        & less(A,X) ) ),
2.90/3.19	    file('Axioms/MGT002+2.ax',in_lopen)).
2.90/3.19	fof(satresetcop_input_15,axiom,
2.90/3.19	    ! [V] :
2.90/3.19	      ( is_verdict(V)
2.90/3.19	     => ( V = unknown
2.90/3.19	        | compatible = V
2.90/3.19	        | conflict = V ) ),
2.90/3.19	    file('Axioms/MGT002+2.ax',verdict_enum)).
2.90/3.19	fof(satresetcop_input_16,axiom,
2.90/3.19	    ! [X,A,B] :
2.90/3.19	      ( in_open(X,A,B)
2.90/3.19	    <=> ( less(X,B)
2.90/3.19	        & less(A,X) ) ),
2.90/3.19	    file('Axioms/MGT002+2.ax',in_open)).
2.90/3.19	fof(satresetcop_input_17,axiom,
2.90/3.19	    ! [V1,V2] :
2.90/3.19	      ( ( conflict = box_verdict(V1,V2)
2.90/3.19	        | unknown = box_verdict(V1,V2)
2.90/3.19	        | compatible = box_verdict(V1,V2) )
2.90/3.19	     <= ( is_verdict(V1)
2.90/3.19	        & is_verdict(V2) ) ),
2.90/3.19	    file('Axioms/MGT002+2.ax',box_verdict_total)).
2.90/3.19	fof(satresetcop_input_18,axiom,
2.90/3.19	    ! [X,A,B] :
2.90/3.19	      ( ( less(X,B)
2.90/3.19	        & leq(A,X) )
2.90/3.19	    <=> in_ropen(X,A,B) ),
2.90/3.19	    file('Axioms/MGT002+2.ax',in_ropen)).
2.90/3.19	fof(satresetcop_input_19,axiom,
2.90/3.19	    ! [V1,V2] :
2.90/3.19	      ( box_verdict(V1,V2) = compatible
2.90/3.19	     <= ( V2 = compatible
2.90/3.19	        & V1 = compatible
2.90/3.19	        & is_verdict(V2)
2.90/3.19	        & is_verdict(V1) ) ),
2.90/3.19	    file('Axioms/MGT002+2.ax',box_compatible)).
2.90/3.19	fof(satresetcop_input_20,axiom,
2.90/3.19	    ! [X,A,B] :
2.90/3.19	      ( ( leq(X,B)
2.90/3.19	        & leq(A,X) )
2.90/3.19	    <=> in_closed(X,A,B) ),
2.90/3.19	    file('Axioms/MGT002+2.ax',in_closed)).
2.90/3.19	fof(satresetcop_input_21,axiom,
2.90/3.19	    ! [I1lo,I1hi,I2lo,I2hi] :
2.90/3.19	      ( axis_conflict(I1lo,I1hi,I2lo,I2hi)
2.90/3.19	    <=> ~ ? [X] :
2.90/3.19	            ( in_closed(X,I1lo,I1hi)
2.90/3.19	            & in_closed(X,I2lo,I2hi) ) ),
2.90/3.19	    file('Axioms/MGT002+2.ax',axis_conflict_def)).
2.90/3.19	fof(satresetcop_input_22,axiom,
2.90/3.19	    unknown != conflict,
2.90/3.19	    file('Axioms/MGT002+2.ax',verdicts_distinct_cf_un)).
2.90/3.19	fof(satresetcop_input_23,axiom,
2.90/3.19	    is_verdict(conflict),
2.90/3.19	    file('Axioms/MGT002+2.ax',conflict_is_verdict)).
2.90/3.19	fof(satresetcop_input_24,axiom,
2.90/3.19	    compatible != conflict,
2.90/3.19	    file('Axioms/MGT002+2.ax',verdicts_distinct_cf_cp)).
2.90/3.19	fof(satresetcop_input_25,axiom,
2.90/3.19	    ! [V1,V2] :
2.90/3.19	      ( unknown = box_verdict(V1,V2)
2.90/3.19	     <= ( is_verdict(V1)
2.90/3.19	        & V1 != conflict
2.90/3.19	        & V2 != conflict
2.90/3.19	        & ( V1 = unknown
2.90/3.19	          | unknown = V2 )
2.90/3.19	        & is_verdict(V2) ) ),
2.90/3.19	    file('Axioms/MGT002+2.ax',box_unknown)).
2.90/3.19	fof(satresetcop_input_26,axiom,
2.90/3.19	    ! [I1lo,I1hi,I2lo,I2hi] :
2.90/3.19	      ( axis_compatible(I1lo,I1hi,I2lo,I2hi)
2.90/3.19	    <=> ? [X] :
2.90/3.19	          ( in_closed(X,I2lo,I2hi)
2.90/3.19	          & in_closed(X,I1lo,I1hi) ) ),
2.90/3.19	    file('Axioms/MGT002+2.ax',axis_compatible_def)).
2.90/3.19	fof(satresetcop_input_27,axiom,
2.90/3.19	    compatible != unknown,
2.90/3.19	    file('Axioms/MGT002+2.ax',verdicts_distinct_cp_un)).
2.90/3.19	fof(satresetcop_input_28,axiom,
2.90/3.19	    less(v0,v800),
2.90/3.19	    file('theBenchmark.p',ord_v0_v800)).
2.90/3.19	fof(satresetcop_input_29,axiom,
2.90/3.19	    less(v0,v400),
2.90/3.19	    file('theBenchmark.p',ord_v0_v400)).
2.90/3.19	fof(satresetcop_input_30,axiom,
2.90/3.19	    val(v400),
2.90/3.19	    file('theBenchmark.p',val_v400)).
2.90/3.19	fof(satresetcop_input_31,axiom,
2.90/3.19	    val(v800),
2.90/3.19	    file('theBenchmark.p',val_v800)).
2.90/3.19	fof(satresetcop_input_32,axiom,
2.90/3.19	    less(v400,v800),
2.90/3.19	    file('theBenchmark.p',ord_v400_v800)).
2.90/3.20	fof(satresetcop_input_33,axiom,
2.90/3.20	    val(v0),
2.90/3.20	    file('theBenchmark.p',val_v0)).
2.90/3.20	fof(satresetcop_input_34,conjecture,
2.90/3.20	    ! [X] :
2.90/3.20	      ( leq(v800,X)
2.90/3.20	     => leq(v400,X) ),
2.90/3.20	    file('theBenchmark.p',odrl311)).
2.90/3.20	fof(satresetcop_negated_conjecture_34,negated_conjecture,
2.90/3.20	    ~ (! [X] :
2.90/3.20	      ( leq(v800,X)
2.90/3.20	     => leq(v400,X) )),
2.90/3.20	    inference(negate,[status(cth)],[satresetcop_input_34])).
2.90/3.20	fof(satresetcop_input_35,axiom,
2.90/3.20	    $distinct(v0,v400,v800),
2.90/3.20	    file('theBenchmark.p',distinct)).
2.90/3.20	fof(satresetcop_premises,plain,
2.90/3.20	    ( (! [X,Y,Z] :
2.90/3.20	      ( less(X,Z)
2.90/3.20	     <= ( less(X,Y)
2.90/3.20	        & leq(Y,Z) ) ))
2.90/3.20	    & (! [X,Y,Z] :
2.90/3.20	      ( less(X,Z)
2.90/3.20	     <= ( less(Y,Z)
2.90/3.20	        & less(X,Y) ) ))
2.90/3.20	    & (! [X,Y] :
2.90/3.20	      ( less(X,Y)
2.90/3.20	      | Y = X
2.90/3.20	      | less(Y,X) ))
2.90/3.20	    & (! [X,Y] :
2.90/3.20	      ( leq(X,Y)
2.90/3.20	    <=> ( less(X,Y)
2.90/3.20	        | X = Y ) ))
2.90/3.20	    & (! [X,Y,Z] :
2.90/3.20	      ( ( leq(X,Y)
2.90/3.20	        & leq(Y,Z) )
2.90/3.20	     => leq(X,Z) ))
2.90/3.20	    & (! [X,Y,Z] :
2.90/3.20	      ( ( less(Y,Z)
2.90/3.20	        & leq(X,Y) )
2.90/3.20	     => less(X,Z) ))
2.90/3.20	    & (! [X,Y] :
2.90/3.20	      ( ( leq(Y,X)
2.90/3.20	        & leq(X,Y) )
2.90/3.20	     => Y = X ))
2.90/3.20	    & (! [X] : ~ less(X,X))
2.90/3.20	    & (! [X,Y] :
2.90/3.20	      ( less(X,Y)
2.90/3.20	     => leq(X,Y) ))
2.90/3.20	    & (is_verdict(compatible))
2.90/3.20	    & (is_verdict(unknown))
2.90/3.20	    & (! [V1,V2] :
2.90/3.20	      ( ( is_verdict(V1)
2.90/3.20	        & is_verdict(V2)
2.90/3.20	        & ( V2 = conflict
2.90/3.20	          | conflict = V1 ) )
2.90/3.20	     => conflict = box_verdict(V1,V2) ))
2.90/3.20	    & (! [I1lo,I1hi,I2lo,I2hi] :
2.90/3.20	      ( axis_subsumes(I1lo,I1hi,I2lo,I2hi)
2.90/3.20	    <=> ! [X] :
2.90/3.20	          ( in_closed(X,I2lo,I2hi)
2.90/3.20	         <= in_closed(X,I1lo,I1hi) ) ))
2.90/3.20	    & (! [X,A,B] :
2.90/3.20	      ( in_lopen(X,A,B)
2.90/3.20	    <=> ( leq(X,B)
2.90/3.20	        & less(A,X) ) ))
2.90/3.20	    & (! [V] :
2.90/3.20	      ( is_verdict(V)
2.90/3.20	     => ( V = unknown
2.90/3.20	        | compatible = V
2.90/3.20	        | conflict = V ) ))
2.90/3.20	    & (! [X,A,B] :
2.90/3.20	      ( in_open(X,A,B)
2.90/3.20	    <=> ( less(X,B)
2.90/3.20	        & less(A,X) ) ))
2.90/3.20	    & (! [V1,V2] :
2.90/3.20	      ( ( conflict = box_verdict(V1,V2)
2.90/3.20	        | unknown = box_verdict(V1,V2)
2.90/3.20	        | compatible = box_verdict(V1,V2) )
2.90/3.20	     <= ( is_verdict(V1)
2.90/3.20	        & is_verdict(V2) ) ))
2.90/3.20	    & (! [X,A,B] :
2.90/3.20	      ( ( less(X,B)
2.90/3.20	        & leq(A,X) )
2.90/3.20	    <=> in_ropen(X,A,B) ))
2.90/3.20	    & (! [V1,V2] :
2.90/3.20	      ( box_verdict(V1,V2) = compatible
2.90/3.20	     <= ( V2 = compatible
2.90/3.20	        & V1 = compatible
2.90/3.20	        & is_verdict(V2)
2.90/3.20	        & is_verdict(V1) ) ))
2.90/3.20	    & (! [X,A,B] :
2.90/3.20	      ( ( leq(X,B)
2.90/3.20	        & leq(A,X) )
2.90/3.20	    <=> in_closed(X,A,B) ))
2.90/3.20	    & (! [I1lo,I1hi,I2lo,I2hi] :
2.90/3.20	      ( axis_conflict(I1lo,I1hi,I2lo,I2hi)
2.90/3.20	    <=> ~ ? [X] :
2.90/3.20	            ( in_closed(X,I1lo,I1hi)
2.90/3.20	            & in_closed(X,I2lo,I2hi) ) ))
2.90/3.20	    & (unknown != conflict)
2.90/3.20	    & (is_verdict(conflict))
2.90/3.20	    & (compatible != conflict)
2.90/3.20	    & (! [V1,V2] :
2.90/3.20	      ( unknown = box_verdict(V1,V2)
2.90/3.20	     <= ( is_verdict(V1)
2.90/3.20	        & V1 != conflict
2.90/3.20	        & V2 != conflict
2.90/3.20	        & ( V1 = unknown
2.90/3.20	          | unknown = V2 )
2.90/3.20	        & is_verdict(V2) ) ))
2.90/3.20	    & (! [I1lo,I1hi,I2lo,I2hi] :
2.90/3.20	      ( axis_compatible(I1lo,I1hi,I2lo,I2hi)
2.90/3.20	    <=> ? [X] :
2.90/3.20	          ( in_closed(X,I2lo,I2hi)
2.90/3.20	          & in_closed(X,I1lo,I1hi) ) ))
2.90/3.20	    & (compatible != unknown)
2.90/3.20	    & (less(v0,v800))
2.90/3.20	    & (less(v0,v400))
2.90/3.20	    & (val(v400))
2.90/3.20	    & (val(v800))
2.90/3.20	    & (less(v400,v800))
2.90/3.20	    & (val(v0))
2.90/3.20	    & (~ (! [X] :
2.90/3.20	      ( leq(v800,X)
2.90/3.20	     => leq(v400,X) )))
2.90/3.20	    & ($distinct(v0,v400,v800)) ),
2.90/3.20	    inference(conjoin,[status(thm)],[satresetcop_input_1,satresetcop_input_2,satresetcop_input_3,satresetcop_input_4,satresetcop_input_5,satresetcop_input_6,satresetcop_input_7,satresetcop_input_8,satresetcop_input_9,satresetcop_input_10,satresetcop_input_11,satresetcop_input_12,satresetcop_input_13,satresetcop_input_14,satresetcop_input_15,satresetcop_input_16,satresetcop_input_17,satresetcop_input_18,satresetcop_input_19,satresetcop_input_20,satresetcop_input_21,satresetcop_input_22,satresetcop_input_23,satresetcop_input_24,satresetcop_input_25,satresetcop_input_26,satresetcop_input_27,satresetcop_input_28,satresetcop_input_29,satresetcop_input_30,satresetcop_input_31,satresetcop_input_32,satresetcop_input_33,satresetcop_negated_conjecture_34,satresetcop_input_35])).
2.90/3.20	fof(satresetcop_cnf_matrix,plain,
2.90/3.20	    ! [X1,X2,X3,X4,X5,X6,X7,X8] :
2.90/3.20	    ( (( leq(v800,f_skolem_4) ))
2.90/3.20	    & (( ~ leq(v400,f_skolem_4) ))
2.90/3.20	    & (( equal___(box_verdict(X1,X2),box_verdict(X3,X4)) | ~ equal___(X1,X3) | ~ equal___(X2,X4) ))
2.90/3.20	    & (( equal___(distinct(X1,X2,X3),distinct(X4,X5,X6)) | ~ equal___(X1,X4) | ~ equal___(X2,X5) | ~ equal___(X3,X6) ))
2.90/3.20	    & (( equal___(X1,X1) ))
2.90/3.20	    & (( ~ equal___(X1,X2) | equal___(X2,X1) ))
2.90/3.20	    & (( equal___(X1,X2) | ~ equal___(X1,X3) | ~ equal___(X3,X2) ))
2.90/3.20	    & (( axis_subsumes(X1,X2,X3,X4) | ~ axis_subsumes(X5,X6,X7,X8) | ~ equal___(X5,X1) | ~ equal___(X6,X2) | ~ equal___(X7,X3) | ~ equal___(X8,X4) ))
2.90/3.20	    & (( in_lopen(X1,X2,X3) | ~ in_lopen(X4,X5,X6) | ~ equal___(X4,X1) | ~ equal___(X5,X2) | ~ equal___(X6,X3) ))
2.90/3.20	    & (( in_open(X1,X2,X3) | ~ in_open(X4,X5,X6) | ~ equal___(X4,X1) | ~ equal___(X5,X2) | ~ equal___(X6,X3) ))
2.90/3.20	    & (( in_ropen(X1,X2,X3) | ~ in_ropen(X4,X5,X6) | ~ equal___(X4,X1) | ~ equal___(X5,X2) | ~ equal___(X6,X3) ))
2.90/3.20	    & (( axis_conflict(X1,X2,X3,X4) | ~ axis_conflict(X5,X6,X7,X8) | ~ equal___(X5,X1) | ~ equal___(X6,X2) | ~ equal___(X7,X3) | ~ equal___(X8,X4) ))
2.90/3.20	    & (( is_verdict(X1) | ~ equal___(X2,X1) | ~ is_verdict(X2) ))
2.90/3.20	    & (( axis_compatible(X1,X2,X3,X4) | ~ axis_compatible(X5,X6,X7,X8) | ~ equal___(X5,X1) | ~ equal___(X6,X2) | ~ equal___(X7,X3) | ~ equal___(X8,X4) ))
2.90/3.20	    & (( in_closed(X1,X2,X3) | ~ in_closed(X4,X5,X6) | ~ equal___(X4,X1) | ~ equal___(X5,X2) | ~ equal___(X6,X3) ))
2.90/3.20	    & (( less(X1,X2) | ~ less(X3,X4) | ~ equal___(X3,X1) | ~ equal___(X4,X2) ))
2.90/3.20	    & (( val(X1) | ~ equal___(X2,X1) | ~ val(X2) ))
2.90/3.20	    & (( '$'(X1) | ~ equal___(X2,X1) | ~ '$'(X2) ))
2.90/3.20	    & (( leq(X1,X2) | ~ leq(X3,X4) | ~ equal___(X3,X1) | ~ equal___(X4,X2) ))
2.90/3.20	    & (( less(X1,X2) | ~ less(X1,X3) | ~ leq(X3,X2) ))
2.90/3.20	    & (( less(X1,X2) | ~ less(X3,X2) | ~ less(X1,X3) ))
2.90/3.20	    & (( less(X1,X2) | equal___(X2,X1) | less(X2,X1) ))
2.90/3.20	    & (( leq(X1,X2) | ~ less(X1,X2) ))
2.90/3.20	    & (( leq(X1,X2) | ~ equal___(X1,X2) ))
2.90/3.20	    & (( ~ leq(X1,X2) | less(X1,X2) | equal___(X1,X2) ))
2.90/3.20	    & (( leq(X1,X2) | ~ leq(X1,X3) | ~ leq(X3,X2) ))
2.90/3.20	    & (( less(X1,X2) | ~ less(X3,X2) | ~ leq(X1,X3) ))
2.90/3.20	    & (( ~ less(X1,X1) ))
2.90/3.20	    & (( ~ less(X1,X2) | leq(X1,X2) ))
2.90/3.20	    & (( equal___(X1,X2) | ~ leq(X1,X2) | ~ leq(X2,X1) ))
2.90/3.20	    & (( less(v0,v800) ))
2.90/3.20	    & (( less(v0,v400) ))
2.90/3.20	    & (( val(v400) ))
2.90/3.20	    & (( val(v800) ))
2.90/3.20	    & (( less(v400,v800) ))
2.90/3.20	    & (( val(v0) ))
2.90/3.20	    & (( '$'(distinct(v0,v400,v800)) ))
2.90/3.20	    & (( is_verdict(compatible) ))
2.90/3.20	    & (( is_verdict(unknown) ))
2.90/3.20	    & (( equal___(conflict,box_verdict(X1,X2)) | ~ is_verdict(X1) | ~ is_verdict(X2) | ~ equal___(X2,conflict) ))
2.90/3.20	    & (( equal___(conflict,box_verdict(X1,X2)) | ~ is_verdict(X1) | ~ is_verdict(X2) | ~ equal___(conflict,X1) ))
2.90/3.20	    & (( axis_subsumes(X1,X2,X3,X4) | in_closed(f_skolem_1(X4,X3,X2,X1),X1,X2) ))
2.90/3.20	    & (( axis_subsumes(X1,X2,X3,X4) | ~ in_closed(f_skolem_1(X4,X3,X2,X1),X3,X4) ))
2.90/3.20	    & (( ~ axis_subsumes(X1,X2,X3,X4) | ~ in_closed(X5,X1,X2) | in_closed(X5,X3,X4) ))
2.90/3.20	    & (( ~ in_lopen(X1,X2,X3) | leq(X1,X3) ))
2.90/3.20	    & (( ~ in_lopen(X1,X2,X3) | less(X2,X1) ))
2.90/3.20	    & (( in_lopen(X1,X2,X3) | ~ leq(X1,X3) | ~ less(X2,X1) ))
2.90/3.20	    & (( ~ is_verdict(X1) | equal___(X1,unknown) | equal___(compatible,X1) | equal___(conflict,X1) ))
2.90/3.20	    & (( ~ in_open(X1,X2,X3) | less(X1,X3) ))
2.90/3.20	    & (( ~ in_open(X1,X2,X3) | less(X2,X1) ))
2.90/3.20	    & (( in_open(X1,X2,X3) | ~ less(X1,X3) | ~ less(X2,X1) ))
2.90/3.20	    & (( ~ is_verdict(X1) | ~ is_verdict(X2) | equal___(conflict,box_verdict(X2,X1)) | equal___(unknown,box_verdict(X2,X1)) | equal___(compatible,box_verdict(X2,X1)) ))
2.90/3.20	    & (( less(X1,X2) | ~ in_ropen(X1,X3,X2) ))
2.90/3.20	    & (( leq(X1,X2) | ~ in_ropen(X2,X1,X3) ))
2.90/3.20	    & (( in_ropen(X1,X2,X3) | ~ less(X1,X3) | ~ leq(X2,X1) ))
2.90/3.20	    & (( equal___(box_verdict(X1,X2),compatible) | ~ equal___(X2,compatible) | ~ equal___(X1,compatible) | ~ is_verdict(X2) | ~ is_verdict(X1) ))
2.90/3.20	    & (( leq(X1,X2) | ~ in_closed(X1,X3,X2) ))
2.90/3.20	    & (( leq(X1,X2) | ~ in_closed(X2,X1,X3) ))
2.90/3.20	    & (( in_closed(X1,X2,X3) | ~ leq(X1,X3) | ~ leq(X2,X1) ))
2.90/3.20	    & (( axis_conflict(X1,X2,X3,X4) | in_closed(f_skolem_2(X4,X3,X2,X1),X1,X2) ))
2.90/3.20	    & (( axis_conflict(X1,X2,X3,X4) | in_closed(f_skolem_2(X4,X3,X2,X1),X3,X4) ))
2.90/3.20	    & (( ~ axis_conflict(X1,X2,X3,X4) | ~ in_closed(X5,X1,X2) | ~ in_closed(X5,X3,X4) ))
2.90/3.20	    & (( ~ equal___(unknown,conflict) ))
2.90/3.20	    & (( is_verdict(conflict) ))
2.90/3.20	    & (( ~ equal___(compatible,conflict) ))
2.90/3.20	    & (( equal___(unknown,box_verdict(X1,X2)) | ~ is_verdict(X1) | equal___(X1,conflict) | equal___(X2,conflict) | ~ equal___(X1,unknown) | ~ is_verdict(X2) ))
2.90/3.20	    & (( equal___(unknown,box_verdict(X1,X2)) | ~ is_verdict(X1) | equal___(X1,conflict) | equal___(X2,conflict) | ~ equal___(unknown,X2) | ~ is_verdict(X2) ))
2.90/3.20	    & (( ~ equal___(compatible,unknown) ))
2.90/3.20	    & (( ~ axis_compatible(X1,X2,X3,X4) | in_closed(f_skolem_3(X4,X3,X2,X1),X3,X4) ))
2.90/3.20	    & (( ~ axis_compatible(X1,X2,X3,X4) | in_closed(f_skolem_3(X4,X3,X2,X1),X1,X2) ))
2.90/3.20	    & (( axis_compatible(X1,X2,X3,X4) | ~ in_closed(X5,X3,X4) | ~ in_closed(X5,X1,X2) )) ),
2.90/3.20	    inference(clausify,[status(esa),new_symbols(skolem,[f_skolem_1,f_skolem_2,f_skolem_3,f_skolem_4]),new_symbols(predicate,[equal___])],[satresetcop_premises])).
2.90/3.20	cnf(satresetcop_matrix_1,plain,
2.90/3.20	    ( leq(v800,f_skolem_4) ),
2.90/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.90/3.20	cnf(satresetcop_matrix_2,plain,
2.90/3.20	    ( ~ leq(v400,f_skolem_4) ),
2.90/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.90/3.20	cnf(satresetcop_matrix_3,plain,
2.90/3.20	    ( equal___(box_verdict(X1,X2),box_verdict(X3,X4)) | ~ equal___(X1,X3) | ~ equal___(X2,X4) ),
2.90/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.90/3.20	cnf(satresetcop_matrix_4,plain,
2.90/3.20	    ( equal___(distinct(X1,X2,X3),distinct(X4,X5,X6)) | ~ equal___(X1,X4) | ~ equal___(X2,X5) | ~ equal___(X3,X6) ),
2.90/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.90/3.20	cnf(satresetcop_matrix_5,plain,
2.90/3.20	    ( equal___(X1,X1) ),
2.90/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.90/3.20	cnf(satresetcop_matrix_6,plain,
2.90/3.20	    ( ~ equal___(X1,X2) | equal___(X2,X1) ),
2.90/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.90/3.20	cnf(satresetcop_matrix_7,plain,
2.90/3.20	    ( equal___(X1,X2) | ~ equal___(X1,X3) | ~ equal___(X3,X2) ),
2.90/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.90/3.20	cnf(satresetcop_matrix_8,plain,
2.90/3.20	    ( axis_subsumes(X1,X2,X3,X4) | ~ axis_subsumes(X5,X6,X7,X8) | ~ equal___(X5,X1) | ~ equal___(X6,X2) | ~ equal___(X7,X3) | ~ equal___(X8,X4) ),
2.90/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.90/3.20	cnf(satresetcop_matrix_9,plain,
2.90/3.20	    ( in_lopen(X1,X2,X3) | ~ in_lopen(X4,X5,X6) | ~ equal___(X4,X1) | ~ equal___(X5,X2) | ~ equal___(X6,X3) ),
2.90/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.90/3.20	cnf(satresetcop_matrix_10,plain,
2.90/3.20	    ( in_open(X1,X2,X3) | ~ in_open(X4,X5,X6) | ~ equal___(X4,X1) | ~ equal___(X5,X2) | ~ equal___(X6,X3) ),
2.90/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.90/3.20	cnf(satresetcop_matrix_11,plain,
2.90/3.20	    ( in_ropen(X1,X2,X3) | ~ in_ropen(X4,X5,X6) | ~ equal___(X4,X1) | ~ equal___(X5,X2) | ~ equal___(X6,X3) ),
2.90/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.90/3.20	cnf(satresetcop_matrix_12,plain,
2.94/3.20	    ( axis_conflict(X1,X2,X3,X4) | ~ axis_conflict(X5,X6,X7,X8) | ~ equal___(X5,X1) | ~ equal___(X6,X2) | ~ equal___(X7,X3) | ~ equal___(X8,X4) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_13,plain,
2.94/3.20	    ( is_verdict(X1) | ~ equal___(X2,X1) | ~ is_verdict(X2) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_14,plain,
2.94/3.20	    ( axis_compatible(X1,X2,X3,X4) | ~ axis_compatible(X5,X6,X7,X8) | ~ equal___(X5,X1) | ~ equal___(X6,X2) | ~ equal___(X7,X3) | ~ equal___(X8,X4) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_15,plain,
2.94/3.20	    ( in_closed(X1,X2,X3) | ~ in_closed(X4,X5,X6) | ~ equal___(X4,X1) | ~ equal___(X5,X2) | ~ equal___(X6,X3) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_16,plain,
2.94/3.20	    ( less(X1,X2) | ~ less(X3,X4) | ~ equal___(X3,X1) | ~ equal___(X4,X2) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_17,plain,
2.94/3.20	    ( val(X1) | ~ equal___(X2,X1) | ~ val(X2) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_18,plain,
2.94/3.20	    ( '$'(X1) | ~ equal___(X2,X1) | ~ '$'(X2) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_19,plain,
2.94/3.20	    ( leq(X1,X2) | ~ leq(X3,X4) | ~ equal___(X3,X1) | ~ equal___(X4,X2) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_20,plain,
2.94/3.20	    ( less(X1,X2) | ~ less(X1,X3) | ~ leq(X3,X2) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_21,plain,
2.94/3.20	    ( less(X1,X2) | ~ less(X3,X2) | ~ less(X1,X3) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_22,plain,
2.94/3.20	    ( less(X1,X2) | equal___(X2,X1) | less(X2,X1) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_23,plain,
2.94/3.20	    ( leq(X1,X2) | ~ less(X1,X2) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_24,plain,
2.94/3.20	    ( leq(X1,X2) | ~ equal___(X1,X2) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_25,plain,
2.94/3.20	    ( ~ leq(X1,X2) | less(X1,X2) | equal___(X1,X2) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_26,plain,
2.94/3.20	    ( leq(X1,X2) | ~ leq(X1,X3) | ~ leq(X3,X2) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_27,plain,
2.94/3.20	    ( less(X1,X2) | ~ less(X3,X2) | ~ leq(X1,X3) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_28,plain,
2.94/3.20	    ( ~ less(X1,X1) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_29,plain,
2.94/3.20	    ( ~ less(X1,X2) | leq(X1,X2) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_30,plain,
2.94/3.20	    ( equal___(X1,X2) | ~ leq(X1,X2) | ~ leq(X2,X1) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_31,plain,
2.94/3.20	    ( less(v0,v800) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_32,plain,
2.94/3.20	    ( less(v0,v400) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_33,plain,
2.94/3.20	    ( val(v400) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_34,plain,
2.94/3.20	    ( val(v800) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_35,plain,
2.94/3.20	    ( less(v400,v800) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_36,plain,
2.94/3.20	    ( val(v0) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_37,plain,
2.94/3.20	    ( '$'(distinct(v0,v400,v800)) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_38,plain,
2.94/3.20	    ( is_verdict(compatible) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_39,plain,
2.94/3.20	    ( is_verdict(unknown) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_40,plain,
2.94/3.20	    ( equal___(conflict,box_verdict(X1,X2)) | ~ is_verdict(X1) | ~ is_verdict(X2) | ~ equal___(X2,conflict) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_41,plain,
2.94/3.20	    ( equal___(conflict,box_verdict(X1,X2)) | ~ is_verdict(X1) | ~ is_verdict(X2) | ~ equal___(conflict,X1) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_42,plain,
2.94/3.20	    ( axis_subsumes(X1,X2,X3,X4) | in_closed(f_skolem_1(X4,X3,X2,X1),X1,X2) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_43,plain,
2.94/3.20	    ( axis_subsumes(X1,X2,X3,X4) | ~ in_closed(f_skolem_1(X4,X3,X2,X1),X3,X4) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_44,plain,
2.94/3.20	    ( ~ axis_subsumes(X1,X2,X3,X4) | ~ in_closed(X5,X1,X2) | in_closed(X5,X3,X4) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_45,plain,
2.94/3.20	    ( ~ in_lopen(X1,X2,X3) | leq(X1,X3) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_46,plain,
2.94/3.20	    ( ~ in_lopen(X1,X2,X3) | less(X2,X1) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_47,plain,
2.94/3.20	    ( in_lopen(X1,X2,X3) | ~ leq(X1,X3) | ~ less(X2,X1) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_48,plain,
2.94/3.20	    ( ~ is_verdict(X1) | equal___(X1,unknown) | equal___(compatible,X1) | equal___(conflict,X1) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_49,plain,
2.94/3.20	    ( ~ in_open(X1,X2,X3) | less(X1,X3) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_50,plain,
2.94/3.20	    ( ~ in_open(X1,X2,X3) | less(X2,X1) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_51,plain,
2.94/3.20	    ( in_open(X1,X2,X3) | ~ less(X1,X3) | ~ less(X2,X1) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_52,plain,
2.94/3.20	    ( ~ is_verdict(X1) | ~ is_verdict(X2) | equal___(conflict,box_verdict(X2,X1)) | equal___(unknown,box_verdict(X2,X1)) | equal___(compatible,box_verdict(X2,X1)) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_53,plain,
2.94/3.20	    ( less(X1,X2) | ~ in_ropen(X1,X3,X2) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_54,plain,
2.94/3.20	    ( leq(X1,X2) | ~ in_ropen(X2,X1,X3) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_55,plain,
2.94/3.20	    ( in_ropen(X1,X2,X3) | ~ less(X1,X3) | ~ leq(X2,X1) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_56,plain,
2.94/3.20	    ( equal___(box_verdict(X1,X2),compatible) | ~ equal___(X2,compatible) | ~ equal___(X1,compatible) | ~ is_verdict(X2) | ~ is_verdict(X1) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_57,plain,
2.94/3.20	    ( leq(X1,X2) | ~ in_closed(X1,X3,X2) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_58,plain,
2.94/3.20	    ( leq(X1,X2) | ~ in_closed(X2,X1,X3) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_59,plain,
2.94/3.20	    ( in_closed(X1,X2,X3) | ~ leq(X1,X3) | ~ leq(X2,X1) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_60,plain,
2.94/3.20	    ( axis_conflict(X1,X2,X3,X4) | in_closed(f_skolem_2(X4,X3,X2,X1),X1,X2) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_61,plain,
2.94/3.20	    ( axis_conflict(X1,X2,X3,X4) | in_closed(f_skolem_2(X4,X3,X2,X1),X3,X4) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_62,plain,
2.94/3.20	    ( ~ axis_conflict(X1,X2,X3,X4) | ~ in_closed(X5,X1,X2) | ~ in_closed(X5,X3,X4) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_63,plain,
2.94/3.20	    ( ~ equal___(unknown,conflict) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_64,plain,
2.94/3.20	    ( is_verdict(conflict) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_65,plain,
2.94/3.20	    ( ~ equal___(compatible,conflict) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_66,plain,
2.94/3.20	    ( equal___(unknown,box_verdict(X1,X2)) | ~ is_verdict(X1) | equal___(X1,conflict) | equal___(X2,conflict) | ~ equal___(X1,unknown) | ~ is_verdict(X2) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_67,plain,
2.94/3.20	    ( equal___(unknown,box_verdict(X1,X2)) | ~ is_verdict(X1) | equal___(X1,conflict) | equal___(X2,conflict) | ~ equal___(unknown,X2) | ~ is_verdict(X2) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_68,plain,
2.94/3.20	    ( ~ equal___(compatible,unknown) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_69,plain,
2.94/3.20	    ( ~ axis_compatible(X1,X2,X3,X4) | in_closed(f_skolem_3(X4,X3,X2,X1),X3,X4) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_70,plain,
2.94/3.20	    ( ~ axis_compatible(X1,X2,X3,X4) | in_closed(f_skolem_3(X4,X3,X2,X1),X1,X2) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_matrix_71,plain,
2.94/3.20	    ( axis_compatible(X1,X2,X3,X4) | ~ in_closed(X5,X3,X4) | ~ in_closed(X5,X1,X2) ),
2.94/3.20	    inference(split_conjunct,[status(thm)],[satresetcop_cnf_matrix])).
2.94/3.20	cnf(satresetcop_ground_1,plain,
2.94/3.20	    ( ~ leq(v800, f_skolem_4) | ~ less(v400, v800) | less(v400, f_skolem_4) ),
2.94/3.20	    inference(instantiate,[status(thm)],[satresetcop_matrix_20])).
2.94/3.20	cnf(satresetcop_ground_2,plain,
2.94/3.20	    ( leq(v400, f_skolem_4) | ~ less(v400, f_skolem_4) ),
2.94/3.20	    inference(instantiate,[status(thm)],[satresetcop_matrix_23])).
2.94/3.20	cnf(satresetcop_ground_3,plain,
2.94/3.20	    ( less(v400, v800) ),
2.94/3.20	    inference(instantiate,[status(thm)],[satresetcop_matrix_35])).
2.94/3.20	cnf(satresetcop_ground_4,plain,
2.94/3.20	    ( leq(v800, f_skolem_4) ),
2.94/3.20	    inference(instantiate,[status(thm)],[satresetcop_matrix_1])).
2.94/3.20	cnf(satresetcop_ground_5,plain,
2.94/3.20	    ( ~ leq(v400, f_skolem_4) ),
2.94/3.20	    inference(instantiate,[status(thm)],[satresetcop_matrix_2])).
2.94/3.20	cnf(satresetcop_false,plain,
2.94/3.20	    $false,
2.94/3.20	    inference(sat_refutation,[status(thm)],[satresetcop_ground_1,satresetcop_ground_2,satresetcop_ground_3,satresetcop_ground_4,satresetcop_ground_5]),
2.94/3.20	    [proof]).
2.94/3.20	% SZS output end CNFRefutation for theBenchmark
2.94/3.27	EOF