%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SET044-5 : TPTP v8.2.0. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n028.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.53s 0.60s % Output : CNFRefutation 0.56s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.12 % Problem : SET044-5 : TPTP v8.2.0. Released v1.0.0. % 0.08/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n028.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:38:08 EDT 2024 % 0.12/0.33 % CPUTime : % 0.18/0.56 start to proof:theBenchmark % 0.53/0.60 %------------------------------------------- % 0.53/0.60 % File :CSE---1.7 % 0.53/0.60 % Problem :theBenchmark % 0.53/0.60 % Transform :cnf % 0.53/0.60 % Format :tptp:raw % 0.53/0.60 % Command :java -jar mcs_scs.jar %d %s % 0.53/0.60 % 0.53/0.60 % Result :Theorem 0.000000s % 0.53/0.60 % Output :CNFRefutation 0.000000s % 0.53/0.60 %------------------------------------------- % 0.53/0.60 %-------------------------------------------------------------------------- % 0.53/0.60 % File : SET044-5 : TPTP v8.2.0. Released v1.0.0. % 0.53/0.60 % Domain : Set Theory % 0.53/0.60 % Problem : Anti-Russell Sets % 0.53/0.60 % Version : [Pel86] axioms : Incomplete. % 0.53/0.60 % English : If there were an anti-Russell set (a set that contains % 0.53/0.60 % exactly those sets that are members of themselves), then not % 0.53/0.60 % every set has a complement. % 0.53/0.60 % 0.53/0.60 % Refs : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au % 0.53/0.60 % : [Pel88] Pelletier (1988), Errata % 0.53/0.60 % Source : [Pel86] % 0.53/0.60 % Names : Pelletier 40 [Pel86] % 0.53/0.60 % : p40.in [ANL] % 0.53/0.60 % 0.53/0.60 % Status : Unsatisfiable % 0.53/0.60 % Rating : 0.00 v7.1.0, 0.17 v7.0.0, 0.12 v6.3.0, 0.14 v6.2.0, 0.00 v2.0.0 % 0.53/0.60 % Syntax : Number of clauses : 4 ( 0 unt; 1 nHn; 3 RR) % 0.53/0.60 % Number of literals : 8 ( 0 equ; 4 neg) % 0.53/0.60 % Maximal clause size : 2 ( 2 avg) % 0.53/0.60 % Maximal term depth : 2 ( 1 avg) % 0.53/0.60 % Number of predicates : 1 ( 1 usr; 0 prp; 2-2 aty) % 0.53/0.60 % Number of functors : 2 ( 2 usr; 1 con; 0-1 aty) % 0.53/0.60 % Number of variables : 6 ( 0 sgn) % 0.53/0.60 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.53/0.60 % 0.53/0.60 % Comments : This problem is incorrect in [Pel86] and is corrected in [Pel88]. % 0.53/0.60 %-------------------------------------------------------------------------- % 0.53/0.60 cnf(clause_1,negated_conjecture, % 0.53/0.60 ( ~ element(X,a) % 0.53/0.60 | element(X,X) ) ). % 0.53/0.60 % 0.53/0.60 cnf(clause_2,negated_conjecture, % 0.53/0.60 ( ~ element(X,X) % 0.53/0.60 | element(X,a) ) ). % 0.53/0.60 % 0.53/0.60 cnf(clause_3,negated_conjecture, % 0.53/0.60 ( ~ element(Y,f(X)) % 0.53/0.60 | ~ element(Y,X) ) ). % 0.53/0.60 % 0.53/0.60 cnf(clause_4,negated_conjecture, % 0.53/0.60 ( element(Y,X) % 0.53/0.60 | element(Y,f(X)) ) ). % 0.53/0.60 % 0.53/0.60 %-------------------------------------------------------------------------- % 0.53/0.60 %------------------------------------------- % 0.53/0.60 % Proof found % 0.53/0.60 % SZS status Theorem for theBenchmark % 0.53/0.60 % SZS output start Proof % 0.53/0.61 %ClaNum:4(EqnAxiom:0) % 0.53/0.61 %VarNum:14(SingletonVarNum:6) % 0.53/0.61 %MaxLitNum:2 % 0.53/0.61 %MaxfuncDepth:1 % 0.53/0.61 %SharedTerms:1 % 0.53/0.61 %goalClause: 1 2 3 4 % 0.53/0.61 [1]P1(x11,x11)+~P1(x11,a1) % 0.53/0.61 [3]~P1(x31,x31)+P1(x31,a1) % 0.53/0.61 [2]P1(x21,x22)+P1(x21,f2(x22)) % 0.53/0.61 [4]~P1(x41,x42)+~P1(x41,f2(x42)) % 0.53/0.61 %EqnAxiom % 0.53/0.61 % 0.53/0.61 %------------------------------------------- % 0.56/0.61 cnf(6,plain, % 0.56/0.61 (P1(x61,x61)+P1(x61,f2(a1))), % 0.56/0.61 inference(scs_inference,[],[2,1])). % 0.56/0.61 cnf(8,plain, % 0.56/0.61 (~P1(f2(a1),a1)), % 0.56/0.61 inference(scs_inference,[],[6,4])). % 0.56/0.61 cnf(11,plain, % 0.56/0.61 ($false), % 0.56/0.61 inference(scs_inference,[],[8,3,6]), % 0.56/0.61 ['proof']). % 0.56/0.61 % SZS output end Proof % 0.56/0.61 % Total time :0.000000s %------------------------------------------------------------------------------