%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SET045-5 : 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 : n032.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:20:17 EDT 2024 % Result : Unsatisfiable 0.52s 0.60s % Output : CNFRefutation 0.52s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SET045-5 : TPTP v8.2.0. Released v1.0.0. % 0.03/0.11 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.10/0.32 % Computer : n032.cluster.edu % 0.10/0.32 % Model : x86_64 x86_64 % 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.32 % Memory : 8042.1875MB % 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.32 % CPULimit : 300 % 0.10/0.32 % WCLimit : 300 % 0.10/0.32 % DateTime : Sun Jun 23 12:29:08 EDT 2024 % 0.10/0.32 % CPUTime : % 0.50/0.56 start to proof:theBenchmark % 0.52/0.59 %------------------------------------------- % 0.52/0.59 % File :CSE---1.7 % 0.52/0.59 % Problem :theBenchmark % 0.52/0.59 % Transform :cnf % 0.52/0.59 % Format :tptp:raw % 0.52/0.59 % Command :java -jar mcs_scs.jar %d %s % 0.52/0.59 % 0.52/0.59 % Result :Theorem 0.010000s % 0.52/0.59 % Output :CNFRefutation 0.010000s % 0.52/0.59 %------------------------------------------- % 0.52/0.60 %-------------------------------------------------------------------------- % 0.52/0.60 % File : SET045-5 : TPTP v8.2.0. Released v1.0.0. % 0.52/0.60 % Domain : Set Theory % 0.52/0.60 % Problem : No Universal Set % 0.52/0.60 % Version : [Pel86] axioms : Incomplete. % 0.52/0.60 % English : The restricted comprehension axiom says : given a set % 0.52/0.60 % z, there is a set all of whose members are drawn from z and % 0.52/0.60 % which satisfy some property. If there were a universal set, % 0.52/0.60 % then the Russell set could be formed, using this axiom. % 0.52/0.60 % So given the appropriate instance of this axiom, there % 0.52/0.60 % is no universal set. % 0.52/0.60 % 0.52/0.60 % Refs : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au % 0.52/0.60 % Source : [Pel86] % 0.52/0.60 % Names : Pelletier 41 [Pel86] % 0.52/0.60 % : p41.in [ANL] % 0.52/0.60 % 0.52/0.60 % Status : Unsatisfiable % 0.52/0.60 % Rating : 0.00 v2.0.0 % 0.52/0.60 % Syntax : Number of clauses : 4 ( 1 unt; 1 nHn; 3 RR) % 0.52/0.60 % Number of literals : 8 ( 0 equ; 4 neg) % 0.52/0.60 % Maximal clause size : 3 ( 2 avg) % 0.52/0.60 % Maximal term depth : 2 ( 1 avg) % 0.52/0.60 % Number of predicates : 1 ( 1 usr; 0 prp; 2-2 aty) % 0.52/0.60 % Number of functors : 2 ( 2 usr; 1 con; 0-1 aty) % 0.52/0.60 % Number of variables : 7 ( 2 sgn) % 0.52/0.60 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.52/0.60 % 0.52/0.60 % Comments : % 0.52/0.60 %-------------------------------------------------------------------------- % 0.52/0.60 cnf(clause_1,axiom, % 0.52/0.60 ( ~ element(X,f(Y)) % 0.52/0.60 | element(X,Y) ) ). % 0.52/0.60 % 0.52/0.60 cnf(clause_2,axiom, % 0.52/0.60 ( ~ element(X,f(Y)) % 0.52/0.60 | ~ element(X,X) ) ). % 0.52/0.60 % 0.52/0.60 cnf(clause_3,axiom, % 0.52/0.60 ( ~ element(X,Y) % 0.52/0.60 | element(X,X) % 0.52/0.60 | element(X,f(Y)) ) ). % 0.52/0.60 % 0.52/0.60 cnf(clause_4,negated_conjecture, % 0.52/0.60 element(X,a) ). % 0.52/0.60 % 0.52/0.60 %-------------------------------------------------------------------------- % 0.52/0.60 %------------------------------------------- % 0.52/0.60 % Proof found % 0.52/0.60 % SZS status Theorem for theBenchmark % 0.52/0.60 % SZS output start Proof % 0.52/0.60 %ClaNum:4(EqnAxiom:0) % 0.52/0.60 %VarNum:15(SingletonVarNum:7) % 0.52/0.60 %MaxLitNum:3 % 0.52/0.60 %MaxfuncDepth:1 % 0.52/0.60 %SharedTerms:1 % 0.52/0.60 %goalClause: 1 % 0.52/0.60 %singleGoalClaCount:1 % 0.52/0.60 [1]P1(x11,a1) % 0.52/0.60 [2]P1(x21,x22)+~P1(x21,f2(x22)) % 0.52/0.60 [3]~P1(x31,x31)+~P1(x31,f2(x32)) % 0.52/0.60 [4]~P1(x41,x42)+P1(x41,x41)+P1(x41,f2(x42)) % 0.52/0.60 %EqnAxiom % 0.52/0.60 % 0.52/0.60 %------------------------------------------- % 0.52/0.60 cnf(6,plain, % 0.52/0.60 ($false), % 0.52/0.60 inference(scs_inference,[],[1,4,3]), % 0.52/0.60 ['proof']). % 0.52/0.60 % SZS output end Proof % 0.52/0.60 % Total time :0.010000s %------------------------------------------------------------------------------