%------------------------------------------------------------------------------
% File : CSE---1.7
% Problem : SET003-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n026.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 : Mon Jun 24 14:19:57 EDT 2024
% Result : Unsatisfiable 0.51s 0.59s
% Output : CNFRefutation 0.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET003-1 : TPTP v8.2.0. Released v1.0.0.
% 0.03/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.11/0.32 % Computer : n026.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sun Jun 23 13:31:09 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.49/0.55 start to proof:theBenchmark
% 0.51/0.59 %-------------------------------------------
% 0.51/0.59 % File :CSE---1.7
% 0.51/0.59 % Problem :theBenchmark
% 0.51/0.59 % Transform :cnf
% 0.51/0.59 % Format :tptp:raw
% 0.51/0.59 % Command :java -jar mcs_scs.jar %d %s
% 0.51/0.59
% 0.51/0.59 % Result :Theorem 0.000000s
% 0.51/0.59 % Output :CNFRefutation 0.000000s
% 0.51/0.59 %-------------------------------------------
% 0.51/0.59 %--------------------------------------------------------------------------
% 0.51/0.59 % File : SET003-1 : TPTP v8.2.0. Released v1.0.0.
% 0.51/0.59 % Domain : Set Theory
% 0.51/0.59 % Problem : A set is a subset of the union of itself with itself
% 0.51/0.59 % Version : [LS74] axioms.
% 0.51/0.59 % English :
% 0.51/0.59
% 0.51/0.59 % Refs : [LS74] Lawrence & Starkey (1974), Experimental Tests of Resol
% 0.51/0.59 % : [WM76] Wilson & Minker (1976), Resolution, Refinements, and S
% 0.51/0.59 % Source : [SPRFN]
% 0.51/0.59 % Names : ls105 [LS74]
% 0.51/0.59 % : ls105 [WM76]
% 0.51/0.59
% 0.51/0.59 % Status : Unsatisfiable
% 0.51/0.59 % Rating : 0.00 v2.0.0
% 0.51/0.59 % Syntax : Number of clauses : 14 ( 2 unt; 3 nHn; 12 RR)
% 0.51/0.59 % Number of literals : 36 ( 0 equ; 18 neg)
% 0.51/0.59 % Maximal clause size : 4 ( 2 avg)
% 0.51/0.59 % Maximal term depth : 2 ( 1 avg)
% 0.51/0.59 % Number of predicates : 4 ( 4 usr; 0 prp; 2-3 aty)
% 0.51/0.59 % Number of functors : 4 ( 4 usr; 2 con; 0-3 aty)
% 0.51/0.59 % Number of variables : 34 ( 2 sgn)
% 0.51/0.59 % SPC : CNF_UNS_RFO_NEQ_NHN
% 0.51/0.59
% 0.51/0.59 % Comments :
% 0.51/0.59 %--------------------------------------------------------------------------
% 0.51/0.59 %----Include the member and subset axioms
% 0.51/0.59 include('Axioms/SET001-0.ax').
% 0.51/0.59 %----Include the member and union axioms
% 0.51/0.59 include('Axioms/SET001-1.ax').
% 0.51/0.59 %--------------------------------------------------------------------------
% 0.51/0.59 cnf(a_union_a_is_aUa,hypothesis,
% 0.51/0.59 union(a,a,aUa) ).
% 0.51/0.59
% 0.51/0.59 cnf(prove_a_is_a_subset_of_aUa,negated_conjecture,
% 0.51/0.59 ~ subset(a,aUa) ).
% 0.51/0.59
% 0.51/0.59 %--------------------------------------------------------------------------
% 0.51/0.59 %-------------------------------------------
% 0.51/0.59 % Proof found
% 0.51/0.59 % SZS status Theorem for theBenchmark
% 0.51/0.59 % SZS output start Proof
% 0.51/0.60 %ClaNum:14(EqnAxiom:0)
% 0.51/0.60 %VarNum:90(SingletonVarNum:34)
% 0.51/0.60 %MaxLitNum:4
% 0.51/0.60 %MaxfuncDepth:1
% 0.51/0.60 %SharedTerms:4
% 0.51/0.60 %goalClause: 2
% 0.51/0.60 %singleGoalClaCount:1
% 0.51/0.60 [1]P1(a1,a1,a2)
% 0.51/0.60 [2]~P2(a1,a2)
% 0.51/0.60 [3]~P3(x32,x31)+P2(x31,x32)
% 0.51/0.60 [4]~P3(x41,x42)+P2(x41,x42)
% 0.51/0.60 [5]P2(x51,x52)+P4(f3(x51,x52),x51)
% 0.51/0.60 [8]P2(x81,x82)+~P4(f3(x81,x82),x82)
% 0.51/0.60 [7]~P2(x71,x72)+~P2(x72,x71)+P3(x71,x72)
% 0.51/0.60 [6]~P2(x63,x62)+P4(x61,x62)+~P4(x61,x63)
% 0.51/0.60 [13]P1(x131,x132,x133)+~P4(f4(x131,x132,x133),x133)+~P4(f4(x131,x132,x133),x132)
% 0.51/0.60 [14]P1(x141,x142,x143)+~P4(f4(x141,x142,x143),x143)+~P4(f4(x141,x142,x143),x141)
% 0.51/0.60 [9]P4(x91,x92)+~P1(x94,x93,x92)+~P4(x91,x93)
% 0.51/0.60 [10]P4(x101,x102)+~P1(x103,x104,x102)+~P4(x101,x103)
% 0.51/0.60 [12]P1(x121,x122,x123)+P4(f4(x121,x122,x123),x123)+P4(f4(x121,x122,x123),x122)+P4(f4(x121,x122,x123),x121)
% 0.51/0.60 [11]~P1(x113,x112,x114)+P4(x111,x112)+P4(x111,x113)+~P4(x111,x114)
% 0.51/0.60 %EqnAxiom
% 0.51/0.60
% 0.51/0.60 %-------------------------------------------
% 0.51/0.60 cnf(15,plain,
% 0.51/0.60 (~P3(a2,a1)),
% 0.51/0.60 inference(scs_inference,[],[2,3])).
% 0.51/0.60 cnf(19,plain,
% 0.51/0.60 (~P2(a2,a1)+P4(f3(a1,a2),a1)),
% 0.51/0.60 inference(scs_inference,[],[15,5,7])).
% 0.51/0.60 cnf(20,plain,
% 0.51/0.60 (~P4(f3(a2,a1),a1)+P4(f3(a1,a2),a1)),
% 0.51/0.60 inference(scs_inference,[],[8,19])).
% 0.51/0.60 cnf(21,plain,
% 0.51/0.60 (~P4(f3(a2,a1),a2)+P4(f3(a1,a2),a1)),
% 0.51/0.60 inference(scs_inference,[],[1,20,11])).
% 0.51/0.60 cnf(22,plain,
% 0.51/0.60 (P2(a2,a1)+P4(f3(a1,a2),a1)),
% 0.51/0.60 inference(scs_inference,[],[21,5])).
% 0.51/0.60 cnf(23,plain,
% 0.51/0.60 (P4(f3(a1,a2),a2)+P2(a2,a1)),
% 0.51/0.60 inference(scs_inference,[],[1,22,9])).
% 0.51/0.60 cnf(24,plain,
% 0.51/0.60 (P2(a2,a1)),
% 0.51/0.60 inference(scs_inference,[],[2,23,8])).
% 0.51/0.60 cnf(25,plain,
% 0.51/0.60 (P4(f3(a1,a2),a1)),
% 0.51/0.60 inference(scs_inference,[],[24,19])).
% 0.51/0.60 cnf(29,plain,
% 0.51/0.60 ($false),
% 0.51/0.60 inference(scs_inference,[],[2,25,1,9,8]),
% 0.51/0.60 ['proof']).
% 0.51/0.60 % SZS output end Proof
% 0.51/0.60 % Total time :0.000000s
%------------------------------------------------------------------------------