%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SEU305+1 : TPTP v9.2.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n007.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:11:25 PM UTC 2026
% Result : Theorem 1.17s 1.88s
% Output : CNFRefutation 1.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 11 unt; 0 def)
% Number of atoms : 125 ( 21 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 146 ( 49 ~; 45 |; 32 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 48 ( 0 sgn 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(redefinition_k3_lattices,axiom,
! [X1,X2,X3] :
( ( ~ empty_carrier(X1)
& join_commutative(X1)
& join_semilatt_str(X1)
& element(X2,the_carrier(X1))
& element(X3,the_carrier(X1)) )
=> join_commut(X1,X2,X3) = join(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k3_lattices) ).
fof(commutativity_k3_lattices,axiom,
! [X1,X2,X3] :
( ( ~ empty_carrier(X1)
& join_commutative(X1)
& join_semilatt_str(X1)
& element(X2,the_carrier(X1))
& element(X3,the_carrier(X1)) )
=> join_commut(X1,X2,X3) = join_commut(X1,X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_lattices) ).
fof(d3_lattices,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& join_semilatt_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( below(X1,X2,X3)
<=> join(X1,X2,X3) = X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_lattices) ).
fof(t26_lattices,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& join_commutative(X1)
& join_semilatt_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( ( below(X1,X2,X3)
& below(X1,X3,X2) )
=> X2 = X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t26_lattices) ).
fof(c_0_4,plain,
! [X1,X2,X3] :
( ( ~ empty_carrier(X1)
& join_commutative(X1)
& join_semilatt_str(X1)
& element(X2,the_carrier(X1))
& element(X3,the_carrier(X1)) )
=> join_commut(X1,X2,X3) = join(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[redefinition_k3_lattices]) ).
fof(c_0_5,plain,
! [X1,X2,X3] :
( ( ~ empty_carrier(X1)
& join_commutative(X1)
& join_semilatt_str(X1)
& element(X2,the_carrier(X1))
& element(X3,the_carrier(X1)) )
=> join_commut(X1,X2,X3) = join_commut(X1,X3,X2) ),
inference(fof_simplification,[status(thm)],[commutativity_k3_lattices]) ).
fof(c_0_6,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& join_semilatt_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( below(X1,X2,X3)
<=> join(X1,X2,X3) = X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[d3_lattices]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& join_commutative(X1)
& join_semilatt_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( ( below(X1,X2,X3)
& below(X1,X3,X2) )
=> X2 = X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t26_lattices])]) ).
fof(c_0_8,plain,
! [X137,X138,X139] :
( empty_carrier(X137)
| ~ join_commutative(X137)
| ~ join_semilatt_str(X137)
| ~ element(X138,the_carrier(X137))
| ~ element(X139,the_carrier(X137))
| join_commut(X137,X138,X139) = join(X137,X138,X139) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
fof(c_0_9,plain,
! [X90,X91,X92] :
( empty_carrier(X90)
| ~ join_commutative(X90)
| ~ join_semilatt_str(X90)
| ~ element(X91,the_carrier(X90))
| ~ element(X92,the_carrier(X90))
| join_commut(X90,X91,X92) = join_commut(X90,X92,X91) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
fof(c_0_10,plain,
! [X96,X97,X98] :
( ( ~ below(X96,X97,X98)
| join(X96,X97,X98) = X98
| ~ element(X98,the_carrier(X96))
| ~ element(X97,the_carrier(X96))
| empty_carrier(X96)
| ~ join_semilatt_str(X96) )
& ( join(X96,X97,X98) != X98
| below(X96,X97,X98)
| ~ element(X98,the_carrier(X96))
| ~ element(X97,the_carrier(X96))
| empty_carrier(X96)
| ~ join_semilatt_str(X96) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_11,negated_conjecture,
( ~ empty_carrier(esk8_0)
& join_commutative(esk8_0)
& join_semilatt_str(esk8_0)
& element(esk9_0,the_carrier(esk8_0))
& element(esk10_0,the_carrier(esk8_0))
& below(esk8_0,esk9_0,esk10_0)
& below(esk8_0,esk10_0,esk9_0)
& esk9_0 != esk10_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_12,plain,
( empty_carrier(X1)
| join_commut(X1,X2,X3) = join(X1,X2,X3)
| ~ join_commutative(X1)
| ~ join_semilatt_str(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( empty_carrier(X1)
| join_commut(X1,X2,X3) = join_commut(X1,X3,X2)
| ~ join_commutative(X1)
| ~ join_semilatt_str(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( join(X1,X2,X3) = X3
| empty_carrier(X1)
| ~ below(X1,X2,X3)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ join_semilatt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
below(esk8_0,esk10_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
element(esk9_0,the_carrier(esk8_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
element(esk10_0,the_carrier(esk8_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
join_semilatt_str(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
~ empty_carrier(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
( join_commut(X1,X2,X3) = join(X1,X3,X2)
| empty_carrier(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1))
| ~ join_semilatt_str(X1)
| ~ join_commutative(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_21,negated_conjecture,
below(esk8_0,esk9_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,negated_conjecture,
join(esk8_0,esk10_0,esk9_0) = esk9_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17]),c_0_18])]),c_0_19]) ).
cnf(c_0_23,plain,
( join(X1,X2,X3) = join(X1,X3,X2)
| empty_carrier(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1))
| ~ join_semilatt_str(X1)
| ~ join_commutative(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
join(esk8_0,esk9_0,esk10_0) = esk10_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_21]),c_0_17]),c_0_16]),c_0_18])]),c_0_19]) ).
cnf(c_0_25,negated_conjecture,
join_commutative(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_26,negated_conjecture,
esk9_0 != esk10_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_16]),c_0_17]),c_0_18]),c_0_25])]),c_0_26]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.21 % Problem : SEU305+1 : TPTP v9.2.1. Released v3.3.0.
% 0.05/0.21 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.13/0.47 % Computer : n007.cluster.edu
% 0.13/0.47 % Model : x86_64 x86_64
% 0.13/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.47 % Memory : 8042.1875MB
% 0.13/0.47 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.47 % CPULimit : 300
% 0.13/0.47 % WCLimit : 300
% 0.13/0.47 % DateTime : Tue May 5 02:55:24 EDT 2026
% 0.13/0.47 % CPUTime :
% 0.13/0.47 % start to proof: theBenchmark
% 1.17/1.88 % Version : CSE_E---1.7
% 1.17/1.88 % Problem : theBenchmark.p
% 1.17/1.88 % SZS status Theorem for theBenchmark.p
% 1.17/1.88 % SZS output start CNFRefutation
% See solution above
% 1.17/1.88 % Total time : 1.391s
%------------------------------------------------------------------------------