%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU124+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n021.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 : 600s
% DateTime : Tue Jul 19 14:34:06 EDT 2022
% Result : Theorem 0.49s 0.69s
% Output : Refutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 11 ( 5 unt; 2 nHn; 11 RR)
% Number of literals : 18 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(7,axiom,
~ subset(skc5,set_union2(skc5,skc4)),
file('SEU124+1.p',unknown),
[] ).
cnf(9,axiom,
equal(set_union2(u,v),set_union2(v,u)),
file('SEU124+1.p',unknown),
[] ).
cnf(14,axiom,
( subset(u,v)
| in(skf3(v,u),u) ),
file('SEU124+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ in(skf3(u,v),u)
| subset(w,u) ),
file('SEU124+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ in(u,v)
| ~ equal(w,set_union2(x,v))
| in(u,w) ),
file('SEU124+1.p',unknown),
[] ).
cnf(24,plain,
~ subset(skc5,set_union2(skc4,skc5)),
inference(rew,[status(thm),theory(equality)],[9,7]),
[iquote('0:Rew:9.0,7.0')] ).
cnf(72,plain,
( ~ in(u,v)
| in(u,set_union2(w,v)) ),
inference(eqr,[status(thm),theory(equality)],[19]),
[iquote('0:EqR:19.1')] ).
cnf(95,plain,
( ~ in(skf3(set_union2(u,v),w),v)
| subset(x,set_union2(u,v)) ),
inference(res,[status(thm),theory(equality)],[72,15]),
[iquote('0:Res:72.1,15.0')] ).
cnf(830,plain,
( subset(u,set_union2(v,u))
| subset(w,set_union2(v,u)) ),
inference(res,[status(thm),theory(equality)],[14,95]),
[iquote('0:Res:14.1,95.0')] ).
cnf(835,plain,
subset(u,set_union2(v,u)),
inference(con,[status(thm)],[830]),
[iquote('0:Con:830.1')] ).
cnf(836,plain,
$false,
inference(unc,[status(thm)],[835,24]),
[iquote('0:UnC:835.0,24.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU124+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 19 04:15:32 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.49/0.69
% 0.49/0.69 SPASS V 3.9
% 0.49/0.69 SPASS beiseite: Proof found.
% 0.49/0.69 % SZS status Theorem
% 0.49/0.69 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.49/0.69 SPASS derived 754 clauses, backtracked 0 clauses, performed 0 splits and kept 462 clauses.
% 0.49/0.69 SPASS allocated 98433 KBytes.
% 0.49/0.69 SPASS spent 0:00:00.33 on the problem.
% 0.49/0.69 0:00:00.04 for the input.
% 0.49/0.69 0:00:00.04 for the FLOTTER CNF translation.
% 0.49/0.69 0:00:00.01 for inferences.
% 0.49/0.69 0:00:00.00 for the backtracking.
% 0.49/0.69 0:00:00.21 for the reduction.
% 0.49/0.69
% 0.49/0.69
% 0.49/0.69 Here is a proof with depth 3, length 11 :
% 0.49/0.69 % SZS output start Refutation
% See solution above
% 0.49/0.69 Formulae used in the proof : t7_xboole_1 commutativity_k2_xboole_0 d3_tarski d2_xboole_0
% 0.49/0.69
%------------------------------------------------------------------------------