%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU104+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n004.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:33:59 EDT 2022
% Result : Theorem 0.48s 0.64s
% Output : Refutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 29 ( 9 unt; 2 nHn; 29 RR)
% Number of literals : 62 ( 0 equ; 40 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(9,axiom,
~ preboolean(skc5),
file('SEU104+1.p',unknown),
[] ).
cnf(27,axiom,
( ~ preboolean(u)
| cup_closed(u) ),
file('SEU104+1.p',unknown),
[] ).
cnf(28,axiom,
( ~ preboolean(u)
| diff_closed(u) ),
file('SEU104+1.p',unknown),
[] ).
cnf(44,axiom,
( preboolean(u)
| in(skf15(u),u) ),
file('SEU104+1.p',unknown),
[] ).
cnf(45,axiom,
( preboolean(u)
| in(skf14(u),u) ),
file('SEU104+1.p',unknown),
[] ).
cnf(47,axiom,
equal(set_union2(u,v),set_union2(v,u)),
file('SEU104+1.p',unknown),
[] ).
cnf(52,axiom,
( ~ in(u,v)
| element(u,v) ),
file('SEU104+1.p',unknown),
[] ).
cnf(55,axiom,
( ~ diff_closed(u)
| ~ cup_closed(u)
| preboolean(u) ),
file('SEU104+1.p',unknown),
[] ).
cnf(60,axiom,
equal(symmetric_difference(u,set_difference(v,u)),set_union2(u,v)),
file('SEU104+1.p',unknown),
[] ).
cnf(67,axiom,
( ~ element(u,skc5)
| ~ element(v,skc5)
| in(symmetric_difference(v,u),skc5) ),
file('SEU104+1.p',unknown),
[] ).
cnf(68,axiom,
( ~ element(u,skc5)
| ~ element(v,skc5)
| in(set_difference(v,u),skc5) ),
file('SEU104+1.p',unknown),
[] ).
cnf(71,axiom,
( ~ in(set_union2(skf15(u),skf14(u)),u)
| ~ in(set_difference(skf15(u),skf14(u)),u)
| preboolean(u) ),
file('SEU104+1.p',unknown),
[] ).
cnf(72,plain,
( ~ in(set_difference(skf15(u),skf14(u)),u)
| ~ in(set_union2(skf14(u),skf15(u)),u)
| preboolean(u) ),
inference(rew,[status(thm),theory(equality)],[47,71]),
[iquote('0:Rew:47.0,71.0')] ).
cnf(74,plain,
( ~ diff_closed(skc5)
| ~ cup_closed(skc5) ),
inference(res,[status(thm),theory(equality)],[55,9]),
[iquote('0:Res:55.2,9.0')] ).
cnf(75,plain,
in(skf15(skc5),skc5),
inference(res,[status(thm),theory(equality)],[44,9]),
[iquote('0:Res:44.1,9.0')] ).
cnf(76,plain,
in(skf14(skc5),skc5),
inference(res,[status(thm),theory(equality)],[45,9]),
[iquote('0:Res:45.1,9.0')] ).
cnf(119,plain,
( ~ preboolean(skc5)
| ~ preboolean(skc5) ),
inference(sor,[status(thm)],[74,28,27]),
[iquote('0:SoR:74.0,74.1,28.1,27.1')] ).
cnf(120,plain,
~ preboolean(skc5),
inference(obv,[status(thm),theory(equality)],[119]),
[iquote('0:Obv:119.0')] ).
cnf(357,plain,
( ~ element(set_difference(u,v),skc5)
| ~ element(v,skc5)
| in(set_union2(v,u),skc5) ),
inference(spr,[status(thm),theory(equality)],[60,67]),
[iquote('0:SpR:60.0,67.2')] ).
cnf(456,plain,
( ~ element(skf14(skc5),skc5)
| ~ element(skf15(skc5),skc5)
| ~ in(set_union2(skf14(skc5),skf15(skc5)),skc5)
| preboolean(skc5) ),
inference(res,[status(thm),theory(equality)],[68,72]),
[iquote('0:Res:68.2,72.0')] ).
cnf(459,plain,
( ~ element(skf14(skc5),skc5)
| ~ element(skf15(skc5),skc5)
| ~ in(set_union2(skf14(skc5),skf15(skc5)),skc5) ),
inference(mrr,[status(thm)],[456,120]),
[iquote('0:MRR:456.3,120.0')] ).
cnf(902,plain,
( ~ in(set_difference(u,v),skc5)
| ~ element(v,skc5)
| in(set_union2(v,u),skc5) ),
inference(res,[status(thm),theory(equality)],[52,357]),
[iquote('0:Res:52.1,357.0')] ).
cnf(1500,plain,
( ~ element(u,skc5)
| ~ element(v,skc5)
| ~ element(u,skc5)
| in(set_union2(u,v),skc5) ),
inference(res,[status(thm),theory(equality)],[68,902]),
[iquote('0:Res:68.2,902.0')] ).
cnf(1505,plain,
( ~ element(u,skc5)
| ~ element(v,skc5)
| in(set_union2(v,u),skc5) ),
inference(obv,[status(thm),theory(equality)],[1500]),
[iquote('0:Obv:1500.0')] ).
cnf(1506,plain,
( ~ element(skf14(skc5),skc5)
| ~ element(skf15(skc5),skc5) ),
inference(mrr,[status(thm)],[459,1505]),
[iquote('0:MRR:459.2,1505.2')] ).
cnf(1534,plain,
( ~ in(skf15(skc5),skc5)
| ~ element(skf14(skc5),skc5) ),
inference(res,[status(thm),theory(equality)],[52,1506]),
[iquote('0:Res:52.1,1506.1')] ).
cnf(1535,plain,
~ element(skf14(skc5),skc5),
inference(mrr,[status(thm)],[1534,75]),
[iquote('0:MRR:1534.0,75.0')] ).
cnf(1536,plain,
~ in(skf14(skc5),skc5),
inference(res,[status(thm),theory(equality)],[52,1535]),
[iquote('0:Res:52.1,1535.0')] ).
cnf(1537,plain,
$false,
inference(mrr,[status(thm)],[1536,76]),
[iquote('0:MRR:1536.0,76.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU104+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n004.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jun 19 08:35:23 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.48/0.64
% 0.48/0.64 SPASS V 3.9
% 0.48/0.64 SPASS beiseite: Proof found.
% 0.48/0.64 % SZS status Theorem
% 0.48/0.64 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.64 SPASS derived 1275 clauses, backtracked 0 clauses, performed 4 splits and kept 614 clauses.
% 0.48/0.64 SPASS allocated 98832 KBytes.
% 0.48/0.64 SPASS spent 0:00:00.28 on the problem.
% 0.48/0.64 0:00:00.04 for the input.
% 0.48/0.64 0:00:00.05 for the FLOTTER CNF translation.
% 0.48/0.64 0:00:00.03 for inferences.
% 0.48/0.64 0:00:00.00 for the backtracking.
% 0.48/0.64 0:00:00.12 for the reduction.
% 0.48/0.64
% 0.48/0.64
% 0.48/0.64 Here is a proof with depth 3, length 29 :
% 0.48/0.64 % SZS output start Refutation
% See solution above
% 0.48/0.64 Formulae used in the proof : t15_finsub_1 cc1_finsub_1 t10_finsub_1 commutativity_k2_xboole_0 t1_subset cc2_finsub_1 t98_xboole_1
% 0.48/0.64
%------------------------------------------------------------------------------