TSTP Solution File: SWV269-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV269-1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n016.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 : Wed Jul 20 21:41:56 EDT 2022
% Result : Unsatisfiable 1.46s 1.67s
% Output : Refutation 1.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 4 unt; 0 nHn; 5 RR)
% Number of literals : 6 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
c_in(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),
file('SWV269-1.p',unknown),
[] ).
cnf(5,axiom,
~ c_in(v_X,c_union(c_Message_Oparts(v_H),c_Message_Osynth(v_H),tc_Message_Omsg),tc_Message_Omsg),
file('SWV269-1.p',unknown),
[] ).
cnf(2647,axiom,
( ~ c_in(u,v,w)
| c_in(u,c_union(x,v,w),w) ),
file('SWV269-1.p',unknown),
[] ).
cnf(3056,plain,
~ c_in(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),
inference(res,[status(thm),theory(equality)],[2647,5]),
[iquote('0:Res:2647.1,5.0')] ).
cnf(3073,plain,
$false,
inference(mrr,[status(thm)],[3056,4]),
[iquote('0:MRR:3056.0,4.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV269-1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n016.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 : Wed Jun 15 22:22:18 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.46/1.67
% 1.46/1.67 SPASS V 3.9
% 1.46/1.67 SPASS beiseite: Proof found.
% 1.46/1.67 % SZS status Theorem
% 1.46/1.67 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.46/1.67 SPASS derived 33 clauses, backtracked 0 clauses, performed 0 splits and kept 2691 clauses.
% 1.46/1.67 SPASS allocated 80050 KBytes.
% 1.46/1.67 SPASS spent 0:00:01.27 on the problem.
% 1.46/1.67 0:00:00.28 for the input.
% 1.46/1.67 0:00:00.00 for the FLOTTER CNF translation.
% 1.46/1.67 0:00:00.00 for inferences.
% 1.46/1.67 0:00:00.00 for the backtracking.
% 1.46/1.67 0:00:00.68 for the reduction.
% 1.46/1.67
% 1.46/1.67
% 1.46/1.67 Here is a proof with depth 1, length 5 :
% 1.46/1.67 % SZS output start Refutation
% See solution above
% 1.46/1.67 Formulae used in the proof : cls_conjecture_0 cls_conjecture_1 cls_Set_OUn__iff_2
% 1.46/1.67
%------------------------------------------------------------------------------