%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SET045+1 : TPTP v8.2.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n020.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 : Theorem 0.57s 0.62s % Output : CNFRefutation 0.57s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET045+1 : TPTP v8.2.0. Released v2.0.0. % 0.07/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n020.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Sun Jun 23 13:06:24 EDT 2024 % 0.12/0.33 % CPUTime : % 0.20/0.58 start to proof:theBenchmark % 0.57/0.62 %------------------------------------------- % 0.57/0.62 % File :CSE---1.7 % 0.57/0.62 % Problem :theBenchmark % 0.57/0.62 % Transform :cnf % 0.57/0.62 % Format :tptp:raw % 0.57/0.62 % Command :java -jar mcs_scs.jar %d %s % 0.57/0.62 % 0.57/0.62 % Result :Theorem 0.000000s % 0.57/0.62 % Output :CNFRefutation 0.000000s % 0.57/0.62 %------------------------------------------- % 0.57/0.62 %-------------------------------------------------------------------------- % 0.57/0.62 % File : SET045+1 : TPTP v8.2.0. Released v2.0.0. % 0.57/0.62 % Domain : Set Theory % 0.57/0.62 % Problem : No Universal Set % 0.57/0.62 % Version : Especial. % 0.57/0.62 % English : The restricted comprehension axiom says : given a set % 0.57/0.62 % z, there is a set all of whose members are drawn from z and % 0.57/0.62 % which satisfy some property. If there were a universal set, % 0.57/0.62 % then the Russell set could be formed, using this axiom. % 0.57/0.62 % So given the appropriate instance of this axiom, there % 0.57/0.62 % is no universal set. % 0.57/0.62 % 0.57/0.62 % Refs : [KM64] Kalish & Montegue (1964), Logic: Techniques of Formal % 0.57/0.62 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au % 0.57/0.62 % : [Hah94] Haehnle (1994), Email to G. Sutcliffe % 0.57/0.62 % Source : [Hah94] % 0.57/0.62 % Names : Pelletier 41 [Pel86] % 0.57/0.62 % 0.57/0.62 % Status : Theorem % 0.57/0.62 % Rating : 0.06 v8.2.0, 0.00 v6.1.0, 0.04 v6.0.0, 0.25 v5.5.0, 0.04 v5.3.0, 0.17 v5.2.0, 0.00 v3.3.0, 0.11 v3.1.0, 0.00 v2.1.0 % 0.57/0.62 % Syntax : Number of formulae : 2 ( 1 unt; 0 def) % 0.57/0.62 % Number of atoms : 4 ( 0 equ) % 0.57/0.62 % Maximal formula atoms : 3 ( 2 avg) % 0.57/0.62 % Number of connectives : 4 ( 2 ~; 0 |; 1 &) % 0.57/0.62 % ( 1 <=>; 0 =>; 0 <=; 0 <~>) % 0.57/0.62 % Maximal formula depth : 7 ( 6 avg) % 0.57/0.62 % Maximal term depth : 1 ( 1 avg) % 0.57/0.62 % Number of predicates : 1 ( 1 usr; 0 prp; 2-2 aty) % 0.57/0.62 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.57/0.62 % Number of variables : 5 ( 3 !; 2 ?) % 0.57/0.62 % SPC : FOF_THM_RFO_NEQ % 0.57/0.62 % 0.57/0.62 % Comments : % 0.57/0.62 %-------------------------------------------------------------------------- % 0.57/0.62 fof(pel41_1,axiom, % 0.57/0.62 ! [Z] : % 0.57/0.62 ? [Y] : % 0.57/0.62 ! [X] : % 0.57/0.62 ( element(X,Y) % 0.57/0.62 <=> ( element(X,Z) % 0.57/0.62 & ~ element(X,X) ) ) ). % 0.57/0.62 % 0.57/0.62 fof(pel41,conjecture, % 0.57/0.62 ~ ? [Z] : % 0.57/0.62 ! [X] : element(X,Z) ). % 0.57/0.62 % 0.57/0.62 %-------------------------------------------------------------------------- % 0.57/0.62 %------------------------------------------- % 0.57/0.62 % Proof found % 0.57/0.62 % SZS status Theorem for theBenchmark % 0.57/0.62 % SZS output start Proof % 0.57/0.63 %ClaNum:4(EqnAxiom:0) % 0.57/0.63 %VarNum:15(SingletonVarNum:7) % 0.57/0.63 %MaxLitNum:3 % 0.57/0.63 %MaxfuncDepth:1 % 0.57/0.63 %SharedTerms:1 % 0.57/0.63 %goalClause: 1 % 0.57/0.63 %singleGoalClaCount:1 % 0.57/0.63 [1]P1(x11,a1) % 0.57/0.63 [2]P1(x21,x22)+~P1(x21,f2(x22)) % 0.57/0.63 [3]~P1(x31,x31)+~P1(x31,f2(x32)) % 0.57/0.63 [4]~P1(x41,x42)+P1(x41,x41)+P1(x41,f2(x42)) % 0.57/0.63 %EqnAxiom % 0.57/0.63 % 0.57/0.63 %------------------------------------------- % 0.57/0.63 cnf(6,plain, % 0.57/0.63 ($false), % 0.57/0.63 inference(scs_inference,[],[1,4,3]), % 0.57/0.63 ['proof']). % 0.57/0.63 % SZS output end Proof % 0.57/0.63 % Total time :0.000000s %------------------------------------------------------------------------------