TSTP Solution File: SET045-5 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SET045-5 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% Computer : n013.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:28:11 EDT 2023
% Result : Unsatisfiable 0.19s 0.62s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET045-5 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34 % Computer : n013.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 : 300
% 0.13/0.34 % DateTime : Sat Aug 26 09:44:17 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.57 start to proof:theBenchmark
% 0.19/0.61 %-------------------------------------------
% 0.19/0.61 % File :CSE---1.6
% 0.19/0.61 % Problem :theBenchmark
% 0.19/0.61 % Transform :cnf
% 0.19/0.61 % Format :tptp:raw
% 0.19/0.61 % Command :java -jar mcs_scs.jar %d %s
% 0.19/0.61
% 0.19/0.61 % Result :Theorem 0.000000s
% 0.19/0.61 % Output :CNFRefutation 0.000000s
% 0.19/0.61 %-------------------------------------------
% 0.19/0.62 %--------------------------------------------------------------------------
% 0.19/0.62 % File : SET045-5 : TPTP v8.1.2. Released v1.0.0.
% 0.19/0.62 % Domain : Set Theory
% 0.19/0.62 % Problem : No Universal Set
% 0.19/0.62 % Version : [Pel86] axioms : Incomplete.
% 0.19/0.62 % English : The restricted comprehension axiom says : given a set
% 0.19/0.62 % z, there is a set all of whose members are drawn from z and
% 0.19/0.62 % which satisfy some property. If there were a universal set,
% 0.19/0.62 % then the Russell set could be formed, using this axiom.
% 0.19/0.62 % So given the appropriate instance of this axiom, there
% 0.19/0.62 % is no universal set.
% 0.19/0.62
% 0.19/0.62 % Refs : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au
% 0.19/0.62 % Source : [Pel86]
% 0.19/0.62 % Names : Pelletier 41 [Pel86]
% 0.19/0.62 % : p41.in [ANL]
% 0.19/0.62
% 0.19/0.62 % Status : Unsatisfiable
% 0.19/0.62 % Rating : 0.00 v2.0.0
% 0.19/0.62 % Syntax : Number of clauses : 4 ( 1 unt; 1 nHn; 3 RR)
% 0.19/0.62 % Number of literals : 8 ( 0 equ; 4 neg)
% 0.19/0.62 % Maximal clause size : 3 ( 2 avg)
% 0.19/0.62 % Maximal term depth : 2 ( 1 avg)
% 0.19/0.62 % Number of predicates : 1 ( 1 usr; 0 prp; 2-2 aty)
% 0.19/0.62 % Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% 0.19/0.62 % Number of variables : 7 ( 2 sgn)
% 0.19/0.62 % SPC : CNF_UNS_RFO_NEQ_NHN
% 0.19/0.62
% 0.19/0.62 % Comments :
% 0.19/0.62 %--------------------------------------------------------------------------
% 0.19/0.62 cnf(clause_1,axiom,
% 0.19/0.62 ( ~ element(X,f(Y))
% 0.19/0.62 | element(X,Y) ) ).
% 0.19/0.62
% 0.19/0.62 cnf(clause_2,axiom,
% 0.19/0.62 ( ~ element(X,f(Y))
% 0.19/0.62 | ~ element(X,X) ) ).
% 0.19/0.62
% 0.19/0.62 cnf(clause_3,axiom,
% 0.19/0.62 ( ~ element(X,Y)
% 0.19/0.62 | element(X,X)
% 0.19/0.62 | element(X,f(Y)) ) ).
% 0.19/0.62
% 0.19/0.62 cnf(clause_4,negated_conjecture,
% 0.19/0.62 element(X,a) ).
% 0.19/0.62
% 0.19/0.62 %--------------------------------------------------------------------------
% 0.19/0.62 %-------------------------------------------
% 0.19/0.62 % Proof found
% 0.19/0.62 % SZS status Theorem for theBenchmark
% 0.19/0.62 % SZS output start Proof
% 0.19/0.62 %ClaNum:4(EqnAxiom:0)
% 0.19/0.62 %VarNum:15(SingletonVarNum:7)
% 0.19/0.62 %MaxLitNum:3
% 0.19/0.62 %MaxfuncDepth:1
% 0.19/0.62 %SharedTerms:1
% 0.19/0.62 %goalClause: 1
% 0.19/0.62 %singleGoalClaCount:1
% 0.19/0.62 [1]P1(x11,a1)
% 0.19/0.62 [2]P1(x21,x22)+~P1(x21,f2(x22))
% 0.19/0.62 [3]~P1(x31,x31)+~P1(x31,f2(x32))
% 0.19/0.62 [4]~P1(x41,x42)+P1(x41,x41)+P1(x41,f2(x42))
% 0.19/0.62 %EqnAxiom
% 0.19/0.62
% 0.19/0.62 %-------------------------------------------
% 0.19/0.62 cnf(7,plain,
% 0.19/0.62 ($false),
% 0.19/0.62 inference(scs_inference,[],[1,4,3]),
% 0.19/0.62 ['proof']).
% 0.19/0.62 % SZS output end Proof
% 0.19/0.62 % Total time :0.000000s
%------------------------------------------------------------------------------