%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN350-1 : TPTP v8.2.0. Released v1.2.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n026.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 19:05:16 EDT 2024 % Result : Unsatisfiable 0.53s 0.62s % Output : CNFRefutation 0.53s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SYN350-1 : TPTP v8.2.0. Released v1.2.0. % 0.00/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n026.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 22:16:39 EDT 2024 % 0.12/0.33 % CPUTime : % 0.19/0.56 start to proof:theBenchmark % 0.53/0.61 %------------------------------------------- % 0.53/0.61 % File :CSE---1.7 % 0.53/0.61 % Problem :theBenchmark % 0.53/0.61 % Transform :cnf % 0.53/0.61 % Format :tptp:raw % 0.53/0.61 % Command :java -jar mcs_scs.jar %d %s % 0.53/0.61 % 0.53/0.61 % Result :Theorem 0.020000s % 0.53/0.61 % Output :CNFRefutation 0.020000s % 0.53/0.61 %------------------------------------------- % 0.53/0.62 %-------------------------------------------------------------------------- % 0.53/0.62 % File : SYN350-1 : TPTP v8.2.0. Released v1.2.0. % 0.53/0.62 % Domain : Syntactic % 0.53/0.62 % Problem : Church problem 46.18 (2) % 0.53/0.62 % Version : Especial. % 0.53/0.62 % English : % 0.53/0.62 % 0.53/0.62 % Refs : [Chu56] Church (1956), Introduction to Mathematical Logic I % 0.53/0.62 % : [FL+93] Fermuller et al. (1993), Resolution Methods for the De % 0.53/0.62 % : [Tam94] Tammet (1994), Email to Geoff Sutcliffe. % 0.53/0.62 % Source : [Tam94] % 0.53/0.62 % Names : Ch18N2 [Tam94] % 0.53/0.62 % 0.53/0.62 % Status : Unsatisfiable % 0.53/0.62 % Rating : 0.00 v2.0.0 % 0.53/0.62 % Syntax : Number of clauses : 6 ( 0 unt; 2 nHn; 5 RR) % 0.53/0.62 % Number of literals : 16 ( 0 equ; 8 neg) % 0.53/0.62 % Maximal clause size : 3 ( 2 avg) % 0.53/0.62 % Maximal term depth : 2 ( 1 avg) % 0.53/0.62 % Number of predicates : 1 ( 1 usr; 0 prp; 2-2 aty) % 0.53/0.62 % Number of functors : 2 ( 2 usr; 1 con; 0-2 aty) % 0.53/0.62 % Number of variables : 12 ( 0 sgn) % 0.53/0.62 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.53/0.62 % 0.53/0.62 % Comments : All the problems here can be decided by using a certain % 0.53/0.62 % completeness-preserving term ordering strategies. See [FL+93]. % 0.53/0.62 % : The conversion from the full 1st order form in [Chu56] % 0.53/0.62 % to clause form was done by hand by Tanel Tammet. % 0.53/0.62 %-------------------------------------------------------------------------- % 0.53/0.62 cnf(clause1,negated_conjecture, % 0.53/0.62 ( ~ f(a,z(X,Y)) % 0.53/0.62 | f(z(X,Y),a) ) ). % 0.53/0.62 % 0.53/0.62 cnf(clause2,negated_conjecture, % 0.53/0.62 ( f(a,z(X,Y)) % 0.53/0.62 | ~ f(z(X,Y),a) ) ). % 0.53/0.62 % 0.53/0.62 cnf(clause3,negated_conjecture, % 0.53/0.62 ( f(a,z(X,Y)) % 0.53/0.62 | f(Y,z(X,Y)) % 0.53/0.62 | f(X,z(X,Y)) ) ). % 0.53/0.62 % 0.53/0.62 cnf(clause4,negated_conjecture, % 0.53/0.62 ( ~ f(a,z(X,Y)) % 0.53/0.62 | ~ f(Y,z(X,Y)) % 0.53/0.62 | f(X,z(X,Y)) ) ). % 0.53/0.62 % 0.53/0.62 cnf(clause5,negated_conjecture, % 0.53/0.62 ( f(a,z(X,Y)) % 0.53/0.62 | f(Y,z(X,Y)) % 0.53/0.62 | ~ f(X,Y) ) ). % 0.53/0.62 % 0.53/0.62 cnf(clause6,negated_conjecture, % 0.53/0.62 ( ~ f(a,z(X,Y)) % 0.53/0.62 | ~ f(Y,z(X,Y)) % 0.53/0.62 | ~ f(X,Y) ) ). % 0.53/0.62 % 0.53/0.62 %-------------------------------------------------------------------------- % 0.53/0.62 %------------------------------------------- % 0.53/0.62 % Proof found % 0.53/0.62 % SZS status Theorem for theBenchmark % 0.53/0.62 % SZS output start Proof % 0.53/0.62 %ClaNum:6(EqnAxiom:0) % 0.53/0.62 %VarNum:38(SingletonVarNum:12) % 0.53/0.62 %MaxLitNum:3 % 0.53/0.62 %MaxfuncDepth:1 % 0.53/0.62 %SharedTerms:1 % 0.53/0.62 %goalClause: 1 2 3 4 5 6 % 0.53/0.62 [1]P1(a1,f2(x11,x12))+~P1(f2(x11,x12),a1) % 0.53/0.62 [2]P1(f2(x21,x22),a1)+~P1(a1,f2(x21,x22)) % 0.53/0.62 [3]~P1(x32,x31)+P1(x31,f2(x32,x31))+P1(a1,f2(x32,x31)) % 0.53/0.62 [4]P1(x41,f2(x42,x41))+P1(x42,f2(x42,x41))+P1(a1,f2(x42,x41)) % 0.53/0.62 [5]~P1(x51,x52)+~P1(x52,f2(x51,x52))+~P1(a1,f2(x51,x52)) % 0.53/0.62 [6]P1(x61,f2(x61,x62))+~P1(x62,f2(x61,x62))+~P1(a1,f2(x61,x62)) % 0.53/0.62 %EqnAxiom % 0.53/0.62 % 0.53/0.62 %------------------------------------------- % 0.53/0.62 cnf(8,plain, % 0.53/0.62 (P1(a1,f2(f2(x81,x82),a1))+~P1(a1,f2(x81,x82))), % 0.53/0.62 inference(scs_inference,[],[3,2])). % 0.53/0.62 cnf(9,plain, % 0.53/0.62 (P1(a1,f2(f2(x91,x92),a1))+~P1(f2(x91,x92),a1)), % 0.53/0.62 inference(scs_inference,[],[8,1])). % 0.53/0.62 cnf(10,plain, % 0.53/0.62 (~P1(f2(x101,x102),a1)+P1(f2(f2(x101,x102),a1),a1)), % 0.53/0.62 inference(scs_inference,[],[9,2])). % 0.53/0.62 cnf(26,plain, % 0.53/0.62 (~P1(x261,x262)+~P1(x262,f2(x261,x262))+~P1(f2(x261,x262),a1)), % 0.53/0.62 inference(scs_inference,[],[1,5])). % 0.53/0.62 cnf(27,plain, % 0.53/0.62 (~P1(x271,a1)+~P1(f2(x271,a1),a1)), % 0.53/0.62 inference(scs_inference,[],[26,1])). % 0.53/0.62 cnf(30,plain, % 0.53/0.62 (~P1(f2(x301,x302),a1)), % 0.53/0.62 inference(scs_inference,[],[27,10])). % 0.53/0.62 cnf(35,plain, % 0.53/0.62 ($false), % 0.53/0.62 inference(scs_inference,[],[30,2,3,4]), % 0.53/0.62 ['proof']). % 0.53/0.62 % SZS output end Proof % 0.53/0.62 % Total time :0.020000s %------------------------------------------------------------------------------