%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SET044+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 : n025.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.15s 0.57s % Output : CNFRefutation 0.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.10 % Problem : SET044+1 : TPTP v8.2.0. Released v2.0.0. % 0.00/0.10 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.09/0.30 % Computer : n025.cluster.edu % 0.09/0.30 % Model : x86_64 x86_64 % 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.30 % Memory : 8042.1875MB % 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64 % 0.09/0.30 % CPULimit : 300 % 0.09/0.30 % WCLimit : 300 % 0.09/0.30 % DateTime : Sun Jun 23 17:18:54 EDT 2024 % 0.09/0.30 % CPUTime : % 0.15/0.53 start to proof:theBenchmark % 0.15/0.57 %------------------------------------------- % 0.15/0.57 % File :CSE---1.7 % 0.15/0.57 % Problem :theBenchmark % 0.15/0.57 % Transform :cnf % 0.15/0.57 % Format :tptp:raw % 0.15/0.57 % Command :java -jar mcs_scs.jar %d %s % 0.15/0.57 % 0.15/0.57 % Result :Theorem 0.000000s % 0.15/0.57 % Output :CNFRefutation 0.000000s % 0.15/0.57 %------------------------------------------- % 0.15/0.57 %-------------------------------------------------------------------------- % 0.15/0.57 % File : SET044+1 : TPTP v8.2.0. Released v2.0.0. % 0.15/0.57 % Domain : Set Theory % 0.15/0.57 % Problem : Anti-Russell Sets % 0.15/0.57 % Version : Especial. % 0.15/0.57 % English : If there were an anti-Russell set (a set that contains exactly % 0.15/0.57 % those sets that are members of themselves), then not every set % 0.15/0.57 % has a complement. % 0.15/0.57 % 0.15/0.57 % Refs : [KM64] Kalish & Montegue (1964), Logic: Techniques of Formal % 0.15/0.57 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au % 0.15/0.57 % : [Hah94] Haehnle (1994), Email to G. Sutcliffe % 0.15/0.57 % Source : [Hah94] % 0.15/0.57 % Names : Pelletier 40 [Pel86] % 0.15/0.57 % 0.15/0.57 % Status : Theorem % 0.15/0.57 % Rating : 0.00 v6.3.0, 0.08 v6.2.0, 0.00 v6.1.0, 0.04 v6.0.0, 0.25 v5.5.0, 0.08 v5.4.0, 0.09 v5.3.0, 0.17 v5.2.0, 0.07 v5.0.0, 0.05 v4.1.0, 0.06 v4.0.1, 0.05 v3.7.0, 0.33 v3.5.0, 0.12 v3.4.0, 0.08 v3.3.0, 0.00 v3.2.0, 0.11 v3.1.0, 0.00 v2.5.0, 0.33 v2.4.0, 0.33 v2.2.1, 0.00 v2.1.0 % 0.15/0.57 % Syntax : Number of formulae : 1 ( 0 unt; 0 def) % 0.15/0.57 % Number of atoms : 4 ( 0 equ) % 0.15/0.57 % Maximal formula atoms : 4 ( 4 avg) % 0.15/0.57 % Number of connectives : 5 ( 2 ~; 0 |; 0 &) % 0.15/0.57 % ( 2 <=>; 1 =>; 0 <=; 0 <~>) % 0.15/0.57 % Maximal formula depth : 8 ( 8 avg) % 0.15/0.57 % Maximal term depth : 1 ( 1 avg) % 0.15/0.57 % Number of predicates : 1 ( 1 usr; 0 prp; 2-2 aty) % 0.15/0.57 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.15/0.57 % Number of variables : 5 ( 3 !; 2 ?) % 0.15/0.57 % SPC : FOF_THM_RFO_NEQ % 0.15/0.57 % 0.15/0.57 % Comments : % 0.15/0.57 %-------------------------------------------------------------------------- % 0.15/0.57 fof(pel40,conjecture, % 0.15/0.57 ( ? [Y] : % 0.15/0.57 ! [X] : % 0.15/0.57 ( element(X,Y) % 0.15/0.57 <=> element(X,X) ) % 0.15/0.57 => ~ ! [X1] : % 0.15/0.57 ? [Y1] : % 0.15/0.57 ! [Z] : % 0.15/0.57 ( element(Z,Y1) % 0.15/0.57 <=> ~ element(Z,X1) ) ) ). % 0.15/0.57 % 0.15/0.57 %-------------------------------------------------------------------------- % 0.15/0.57 %------------------------------------------- % 0.15/0.57 % Proof found % 0.15/0.57 % SZS status Theorem for theBenchmark % 0.15/0.57 % SZS output start Proof % 0.15/0.57 %ClaNum:4(EqnAxiom:0) % 0.15/0.57 %VarNum:14(SingletonVarNum:6) % 0.15/0.57 %MaxLitNum:2 % 0.15/0.57 %MaxfuncDepth:1 % 0.15/0.57 %SharedTerms:1 % 0.15/0.57 %goalClause: 1 2 3 4 % 0.15/0.57 [1]P1(x11,x11)+~P1(x11,a1) % 0.15/0.57 [3]~P1(x31,x31)+P1(x31,a1) % 0.15/0.57 [2]P1(x21,x22)+P1(x21,f2(x22)) % 0.15/0.57 [4]~P1(x41,x42)+~P1(x41,f2(x42)) % 0.15/0.57 %EqnAxiom % 0.15/0.57 % 0.15/0.57 %------------------------------------------- % 0.15/0.58 cnf(6,plain, % 0.15/0.58 (P1(x61,x61)+P1(x61,f2(a1))), % 0.15/0.58 inference(scs_inference,[],[2,1])). % 0.15/0.58 cnf(8,plain, % 0.15/0.58 (~P1(f2(a1),a1)), % 0.15/0.58 inference(scs_inference,[],[6,4])). % 0.15/0.58 cnf(11,plain, % 0.15/0.58 ($false), % 0.15/0.58 inference(scs_inference,[],[8,3,6]), % 0.15/0.58 ['proof']). % 0.15/0.58 % SZS output end Proof % 0.15/0.58 % Total time :0.000000s %------------------------------------------------------------------------------