%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SET046-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 : 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:18 EDT 2024 % Result : Unsatisfiable 0.20s 0.67s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.12 % Problem : SET046-5 : TPTP v8.2.0. Released v1.0.0. % 0.08/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 15:56:09 EDT 2024 % 0.12/0.33 % CPUTime : % 0.20/0.62 start to proof:theBenchmark % 0.20/0.66 %------------------------------------------- % 0.20/0.66 % File :CSE---1.7 % 0.20/0.66 % Problem :theBenchmark % 0.20/0.66 % Transform :cnf % 0.20/0.66 % Format :tptp:raw % 0.20/0.66 % Command :java -jar mcs_scs.jar %d %s % 0.20/0.66 % 0.20/0.66 % Result :Theorem 0.000000s % 0.20/0.66 % Output :CNFRefutation 0.000000s % 0.20/0.66 %------------------------------------------- % 0.20/0.66 %-------------------------------------------------------------------------- % 0.20/0.66 % File : SET046-5 : TPTP v8.2.0. Released v1.0.0. % 0.20/0.66 % Domain : Set Theory % 0.20/0.66 % Problem : No set of non-circular sets % 0.20/0.66 % Version : [Pel86] axioms : Incomplete. % 0.20/0.66 % English : A set is circular if it is a member of another set which % 0.20/0.66 % in turn is a member of the orginal. Intuitively all sets are % 0.20/0.66 % non-circular. Prove there is no set of non-circular sets. % 0.20/0.66 % 0.20/0.66 % Refs : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au % 0.20/0.66 % Source : [Pel86] % 0.20/0.66 % Names : Pelletier 42 [Pel86] % 0.20/0.66 % : p42.in [ANL] % 0.20/0.66 % 0.20/0.66 % Status : Unsatisfiable % 0.20/0.66 % Rating : 0.00 v7.4.0, 0.17 v7.1.0, 0.33 v7.0.0, 0.25 v6.3.0, 0.29 v6.2.0, 0.11 v6.1.0, 0.00 v2.0.0 % 0.20/0.66 % Syntax : Number of clauses : 3 ( 0 unt; 2 nHn; 1 RR) % 0.20/0.66 % Number of literals : 7 ( 0 equ; 3 neg) % 0.20/0.66 % Maximal clause size : 3 ( 2 avg) % 0.20/0.66 % Maximal term depth : 2 ( 1 avg) % 0.20/0.66 % Number of predicates : 1 ( 1 usr; 0 prp; 2-2 aty) % 0.20/0.66 % Number of functors : 2 ( 2 usr; 1 con; 0-1 aty) % 0.20/0.66 % Number of variables : 4 ( 0 sgn) % 0.20/0.66 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.20/0.66 % 0.20/0.66 % Comments : % 0.20/0.66 %-------------------------------------------------------------------------- % 0.20/0.66 cnf(clause_1,negated_conjecture, % 0.20/0.66 ( ~ element(X,a) % 0.20/0.66 | ~ element(X,Y) % 0.20/0.66 | ~ element(Y,X) ) ). % 0.20/0.66 % 0.20/0.66 cnf(clause_2,negated_conjecture, % 0.20/0.66 ( element(X,f(X)) % 0.20/0.67 | element(X,a) ) ). % 0.20/0.67 % 0.20/0.67 cnf(clause_3,negated_conjecture, % 0.20/0.67 ( element(f(X),X) % 0.20/0.67 | element(X,a) ) ). % 0.20/0.67 % 0.20/0.67 %-------------------------------------------------------------------------- % 0.20/0.67 %------------------------------------------- % 0.20/0.67 % Proof found % 0.20/0.67 % SZS status Theorem for theBenchmark % 0.20/0.67 % SZS output start Proof % 0.20/0.67 %ClaNum:3(EqnAxiom:0) % 0.20/0.67 %VarNum:11(SingletonVarNum:4) % 0.20/0.67 %MaxLitNum:3 % 0.20/0.67 %MaxfuncDepth:1 % 0.20/0.67 %SharedTerms:1 % 0.20/0.67 %goalClause: 1 2 3 % 0.20/0.67 [1]P1(x11,f2(x11))+P1(x11,a1) % 0.20/0.67 [2]P1(f2(x21),x21)+P1(x21,a1) % 0.20/0.67 [3]~P1(x32,x31)+~P1(x31,x32)+~P1(x32,a1) % 0.20/0.67 %EqnAxiom % 0.20/0.67 % 0.20/0.67 %------------------------------------------- % 0.20/0.67 cnf(4,plain, % 0.20/0.67 (~P1(x41,x42)+~P1(x42,x41)+P1(x42,f2(x42))), % 0.20/0.67 inference(scs_inference,[],[1,3])). % 0.20/0.67 cnf(10,plain, % 0.20/0.67 (~P1(a1,x101)+P1(a1,f2(a1))+P1(x101,f2(x101))), % 0.20/0.67 inference(scs_inference,[],[1,4])). % 0.20/0.67 cnf(11,plain, % 0.20/0.67 (~P1(f2(a1),a1)+~P1(a1,a1)), % 0.20/0.67 inference(scs_inference,[],[10,3])). % 0.20/0.67 cnf(12,plain, % 0.20/0.67 (~P1(f2(a1),a1)+P1(a1,f2(a1))), % 0.20/0.67 inference(scs_inference,[],[11,1])). % 0.20/0.67 cnf(13,plain, % 0.20/0.67 (~P1(f2(a1),a1)), % 0.20/0.67 inference(scs_inference,[],[12,3])). % 0.20/0.67 cnf(19,plain, % 0.20/0.67 ($false), % 0.20/0.67 inference(scs_inference,[],[13,1,2,3]), % 0.20/0.67 ['proof']). % 0.20/0.67 % SZS output end Proof % 0.20/0.67 % Total time :0.000000s %------------------------------------------------------------------------------