%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SET043+1 : TPTP v8.2.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % Computer : n027.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:16 EDT 2024 % Result : Theorem 0.50s 0.60s % Output : CNFRefutation 0.50s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET043+1 : TPTP v8.2.0. Released v2.0.0. % 0.07/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n027.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 11:50:39 EDT 2024 % 0.12/0.33 % CPUTime : % 0.50/0.57 start to proof:theBenchmark % 0.50/0.59 %------------------------------------------- % 0.50/0.59 % File :CSE---1.7 % 0.50/0.59 % Problem :theBenchmark % 0.50/0.59 % Transform :cnf % 0.50/0.60 % Format :tptp:raw % 0.50/0.60 % Command :java -jar mcs_scs.jar %d %s % 0.50/0.60 % 0.50/0.60 % Result :Theorem 0.000000s % 0.50/0.60 % Output :CNFRefutation 0.000000s % 0.50/0.60 %------------------------------------------- % 0.50/0.60 %-------------------------------------------------------------------------- % 0.50/0.60 % File : SET043+1 : TPTP v8.2.0. Released v2.0.0. % 0.50/0.60 % Domain : Set Theory % 0.50/0.60 % Problem : Russell's Paradox % 0.50/0.60 % Version : Especial. % 0.50/0.60 % English : Russell's paradox : there is no Russell set (a set which % 0.50/0.60 % contains exactly those sets which are not members % 0.50/0.60 % of themselves). % 0.50/0.60 % 0.50/0.60 % Refs : [KM64] Kalish & Montegue (1964), Logic: Techniques of Formal % 0.50/0.60 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au % 0.50/0.60 % : [Hah94] Haehnle (1994), Email to G. Sutcliffe % 0.50/0.60 % Source : [Hah94] % 0.50/0.60 % Names : Pelletier 39 [Pel86] % 0.50/0.60 % 0.50/0.60 % Status : Theorem % 0.50/0.60 % Rating : 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v2.1.0 % 0.50/0.60 % Syntax : Number of formulae : 1 ( 0 unt; 0 def) % 0.50/0.60 % Number of atoms : 2 ( 0 equ) % 0.50/0.60 % Maximal formula atoms : 2 ( 2 avg) % 0.50/0.60 % Number of connectives : 3 ( 2 ~; 0 |; 0 &) % 0.50/0.60 % ( 1 <=>; 0 =>; 0 <=; 0 <~>) % 0.50/0.60 % Maximal formula depth : 6 ( 6 avg) % 0.50/0.60 % Maximal term depth : 1 ( 1 avg) % 0.50/0.60 % Number of predicates : 1 ( 1 usr; 0 prp; 2-2 aty) % 0.50/0.60 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.50/0.60 % Number of variables : 2 ( 1 !; 1 ?) % 0.50/0.60 % SPC : FOF_THM_EPR_NEQ % 0.50/0.60 % 0.50/0.60 % Comments : % 0.50/0.60 %-------------------------------------------------------------------------- % 0.50/0.60 fof(pel39,conjecture, % 0.50/0.60 ~ ? [X] : % 0.50/0.60 ! [Y] : % 0.50/0.60 ( element(Y,X) % 0.50/0.60 <=> ~ element(Y,Y) ) ). % 0.50/0.60 % 0.50/0.60 %-------------------------------------------------------------------------- % 0.50/0.60 %------------------------------------------- % 0.50/0.60 % Proof found % 0.50/0.60 % SZS status Theorem for theBenchmark % 0.50/0.60 % SZS output start Proof % 0.50/0.60 %ClaNum:2(EqnAxiom:0) % 0.50/0.60 %VarNum:6(SingletonVarNum:2) % 0.50/0.60 %MaxLitNum:2 % 0.50/0.60 %MaxfuncDepth:0 % 0.50/0.60 %SharedTerms:1 % 0.50/0.60 %goalClause: 1 2 % 0.50/0.60 [1]P1(x11,x11)+P1(x11,a1) % 0.50/0.60 [2]~P1(x21,x21)+~P1(x21,a1) % 0.50/0.60 %EqnAxiom % 0.50/0.60 % 0.50/0.60 %------------------------------------------- % 0.50/0.60 cnf(3,plain, % 0.50/0.60 ($false), % 0.50/0.60 inference(scs_inference,[],[1,2]), % 0.50/0.60 ['proof']). % 0.50/0.60 % SZS output end Proof % 0.50/0.60 % Total time :0.000000s %------------------------------------------------------------------------------