TSTP Solution File: SET850-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SET850-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 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 : Thu Aug 31 14:31:23 EDT 2023
% Result : Unsatisfiable 0.20s 0.66s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET850-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 15:14:48 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.60 start to proof:theBenchmark
% 0.20/0.65 %-------------------------------------------
% 0.20/0.65 % File :CSE---1.6
% 0.20/0.65 % Problem :theBenchmark
% 0.20/0.65 % Transform :cnf
% 0.20/0.65 % Format :tptp:raw
% 0.20/0.65 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.65
% 0.20/0.65 % Result :Theorem 0.000000s
% 0.20/0.65 % Output :CNFRefutation 0.000000s
% 0.20/0.65 %-------------------------------------------
% 0.20/0.66 %------------------------------------------------------------------------------
% 0.20/0.66 % File : SET850-2 : TPTP v8.1.2. Released v3.2.0.
% 0.20/0.66 % Domain : Set Theory
% 0.20/0.66 % Problem : Problem about Zorn's lemma
% 0.20/0.66 % Version : [Pau06] axioms : Reduced > Especial.
% 0.20/0.66 % English :
% 0.20/0.66
% 0.20/0.66 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.20/0.66 % Source : [Pau06]
% 0.20/0.66 % Names :
% 0.20/0.66
% 0.20/0.66 % Status : Unsatisfiable
% 0.20/0.66 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0
% 0.20/0.66 % Syntax : Number of clauses : 4 ( 3 unt; 0 nHn; 3 RR)
% 0.20/0.66 % Number of literals : 6 ( 0 equ; 3 neg)
% 0.20/0.66 % Maximal clause size : 3 ( 1 avg)
% 0.20/0.66 % Maximal term depth : 3 ( 1 avg)
% 0.20/0.66 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty)
% 0.20/0.66 % Number of functors : 6 ( 6 usr; 4 con; 0-3 aty)
% 0.20/0.66 % Number of variables : 7 ( 1 sgn)
% 0.20/0.66 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.20/0.66
% 0.20/0.66 % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.20/0.66 % of which only a small selection are required for the refutation.
% 0.20/0.66 % The mission is to find those few axioms, after which a refutation
% 0.20/0.66 % can be quite easily found. This version has only the necessary
% 0.20/0.66 % axioms.
% 0.20/0.66 %------------------------------------------------------------------------------
% 0.20/0.66 cnf(cls_Set_Osubset__trans_0,axiom,
% 0.20/0.66 ( ~ c_lessequals(V_B,V_C,tc_set(T_a))
% 0.20/0.66 | ~ c_lessequals(V_A,V_B,tc_set(T_a))
% 0.20/0.66 | c_lessequals(V_A,V_C,tc_set(T_a)) ) ).
% 0.20/0.66
% 0.20/0.66 cnf(cls_Zorn_OAbrial__axiom1_0,axiom,
% 0.20/0.66 c_lessequals(V_x,c_Zorn_Osucc(V_S,V_x,T_a),tc_set(tc_set(T_a))) ).
% 0.20/0.66
% 0.20/0.66 cnf(cls_conjecture_0,negated_conjecture,
% 0.20/0.66 c_lessequals(v_x,v_y,tc_set(tc_set(t_a))) ).
% 0.20/0.66
% 0.20/0.66 cnf(cls_conjecture_1,negated_conjecture,
% 0.20/0.66 ~ c_lessequals(v_x,c_Zorn_Osucc(v_S,v_y,t_a),tc_set(tc_set(t_a))) ).
% 0.20/0.66
% 0.20/0.66 %------------------------------------------------------------------------------
% 0.20/0.66 %-------------------------------------------
% 0.20/0.66 % Proof found
% 0.20/0.66 % SZS status Theorem for theBenchmark
% 0.20/0.66 % SZS output start Proof
% 0.20/0.66 %ClaNum:4(EqnAxiom:0)
% 0.20/0.66 %VarNum:14(SingletonVarNum:7)
% 0.20/0.66 %MaxLitNum:3
% 0.20/0.66 %MaxfuncDepth:2
% 0.20/0.66 %SharedTerms:9
% 0.20/0.66 %goalClause: 1 3
% 0.20/0.66 %singleGoalClaCount:2
% 0.20/0.66 [1]P1(a1,a6,f4(f4(a2)))
% 0.20/0.66 [3]~P1(a1,f3(a5,a6,a2),f4(f4(a2)))
% 0.20/0.66 [2]P1(x21,f3(x22,x21,x23),f4(f4(x23)))
% 0.20/0.66 [4]P1(x41,x42,f4(x43))+~P1(x44,x42,f4(x43))+~P1(x41,x44,f4(x43))
% 0.20/0.66 %EqnAxiom
% 0.20/0.66
% 0.20/0.66 %-------------------------------------------
% 0.20/0.67 cnf(5,plain,
% 0.20/0.67 ($false),
% 0.20/0.67 inference(scs_inference,[],[3,2,1,4]),
% 0.20/0.67 ['proof']).
% 0.20/0.67 % SZS output end Proof
% 0.20/0.67 % Total time :0.000000s
%------------------------------------------------------------------------------