%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : PUZ063-2 : TPTP v9.2.1. Released v3.2.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 : n022.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:02:50 PM UTC 2026
% Result : Unsatisfiable 0.23s 1.61s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 21
% Syntax : Number of clauses : 34 ( 18 unt; 0 nHn; 18 RR)
% Number of literals : 58 ( 38 equ; 29 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 80 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(c_union(c_emptyset,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Set_OUn__empty__left_0,axiom,
c_union(c_emptyset,X1,X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUn__empty__left_0) ).
cnf(i_0_3,negated_conjecture,
~ c_in(c_union(c_emptyset,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
cls_conjecture_2,
[final] ).
cnf(i_0_4,negated_conjecture,
c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
cls_conjecture_0,
[final] ).
cnf(i_0_5,axiom,
c_union(c_emptyset,X1,X2) = X1,
cls_Set_OUn__empty__left_0,
[final] ).
cnf(i_0_6,axiom,
X1 = X1 ).
cnf(i_0_7,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_8,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_9,axiom,
( X1 != X2
| c_union(X1,X3,X4) = c_union(X2,X3,X4) ) ).
cnf(i_0_10,axiom,
( X1 != X2
| c_union(X3,X1,X4) = c_union(X3,X2,X4) ) ).
cnf(i_0_11,axiom,
( X1 != X2
| c_union(X3,X4,X1) = c_union(X3,X4,X2) ) ).
cnf(i_0_12,axiom,
( X1 != X2
| ~ c_in(X1,X3,X4)
| c_in(X2,X3,X4) ) ).
cnf(i_0_13,axiom,
( X1 != X2
| ~ c_in(X3,X1,X4)
| c_in(X3,X2,X4) ) ).
cnf(i_0_14,axiom,
( X1 != X2
| ~ c_in(X3,X4,X1)
| c_in(X3,X4,X2) ) ).
cnf(i_0_6_001,axiom,
X1 = X1 ).
cnf(i_0_7_002,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_8_003,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_9_004,axiom,
( X1 != X2
| c_union(X1,X3,X4) = c_union(X2,X3,X4) ) ).
cnf(i_0_10_005,axiom,
( X1 != X2
| c_union(X3,X1,X4) = c_union(X3,X2,X4) ) ).
cnf(i_0_11_006,axiom,
( X1 != X2
| c_union(X3,X4,X1) = c_union(X3,X4,X2) ) ).
cnf(i_0_12_007,axiom,
( X1 != X2
| ~ c_in(X1,X3,X4)
| c_in(X2,X3,X4) ) ).
cnf(i_0_13_008,axiom,
( X1 != X2
| ~ c_in(X3,X1,X4)
| c_in(X3,X2,X4) ) ).
cnf(i_0_14_009,axiom,
( X1 != X2
| ~ c_in(X3,X4,X1)
| c_in(X3,X4,X2) ) ).
cnf(i_0_15,plain,
X1 = c_union(c_emptyset,X1,X2),
inference(scs_inference,[],[i_0_5,i_0_7]) ).
cnf(i_0_16,plain,
~ c_in(c_union(c_emptyset,c_union(c_emptyset,v_u,t_a),X1),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
inference(scs_inference,[],[i_0_3,i_0_5,i_0_7,i_0_12]) ).
cnf(i_0_17,plain,
c_union(c_emptyset,X1,X2) = X1,
inference(rename_variables,[],[i_0_5]) ).
cnf(i_0_18,plain,
~ c_in(c_union(c_emptyset,v_u,t_a),c_union(c_emptyset,c_Mutil_Otiling(v_A,t_a),X1),tc_set(t_a)),
inference(scs_inference,[],[i_0_3,i_0_5,i_0_17,i_0_7,i_0_12,i_0_13]) ).
cnf(i_0_19,plain,
c_union(c_emptyset,X1,X2) = X1,
inference(rename_variables,[],[i_0_5]) ).
cnf(i_0_20,plain,
~ c_in(c_union(c_emptyset,v_u,t_a),c_Mutil_Otiling(v_A,t_a),c_union(c_emptyset,tc_set(t_a),X1)),
inference(scs_inference,[],[i_0_3,i_0_5,i_0_17,i_0_19,i_0_7,i_0_12,i_0_13,i_0_14]) ).
cnf(i_0_21,plain,
c_union(c_emptyset,X1,X2) = X1,
inference(rename_variables,[],[i_0_5]) ).
cnf(i_0_22,plain,
c_union(c_emptyset,X1,X2) = c_union(c_emptyset,X1,X3),
inference(scs_inference,[],[i_0_15,i_0_5,i_0_8]) ).
cnf(i_0_23,plain,
X1 = c_union(c_emptyset,X1,X2),
inference(rename_variables,[],[i_0_15]) ).
cnf(i_0_24,plain,
$false,
inference(scs_inference,[],[i_0_3,i_0_4,i_0_15,i_0_23,i_0_5,i_0_8,i_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : PUZ063-2 : TPTP v9.2.1. Released v3.2.0.
% 0.00/0.11 % 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.15/0.32 % Computer : n022.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Tue May 5 01:35:21 EDT 2026
% 0.15/0.32 % CPUTime :
% 0.15/0.33 % start to proof: theBenchmark
% 0.23/1.61 % Version : CSE_E---1.7
% 0.23/1.61 % Problem : theBenchmark.p
% 0.23/1.61 % SZS status Unsatisfiable for theBenchmark.p
% 0.23/1.61 % SZS output start CNFRefutation
% See solution above
% 0.23/1.63 % Total time : 1.270s
%------------------------------------------------------------------------------