%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN327-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 : 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 19:05:10 EDT 2024 % Result : Unsatisfiable 0.19s 0.59s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SYN327-1 : TPTP v8.2.0. Released v1.2.0. % 0.11/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.32 % Computer : n028.cluster.edu % 0.12/0.32 % Model : x86_64 x86_64 % 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.32 % Memory : 8042.1875MB % 0.12/0.32 % 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 23:21:54 EDT 2024 % 0.12/0.33 % CPUTime : % 0.19/0.56 start to proof:theBenchmark % 0.19/0.58 %------------------------------------------- % 0.19/0.58 % File :CSE---1.7 % 0.19/0.58 % Problem :theBenchmark % 0.19/0.58 % Transform :cnf % 0.19/0.58 % Format :tptp:raw % 0.19/0.58 % Command :java -jar mcs_scs.jar %d %s % 0.19/0.58 % 0.19/0.58 % Result :Theorem 0.000000s % 0.19/0.58 % Output :CNFRefutation 0.000000s % 0.19/0.58 %------------------------------------------- % 0.19/0.59 %-------------------------------------------------------------------------- % 0.19/0.59 % File : SYN327-1 : TPTP v8.2.0. Released v1.2.0. % 0.19/0.59 % Domain : Syntactic % 0.19/0.59 % Problem : Church problem 46.12 (2) % 0.19/0.59 % Version : Especial. % 0.19/0.59 % English : % 0.19/0.59 % 0.19/0.59 % Refs : [Chu56] Church (1956), Introduction to Mathematical Logic I % 0.19/0.59 % : [FL+93] Fermuller et al. (1993), Resolution Methods for the De % 0.19/0.59 % : [Tam94] Tammet (1994), Email to Geoff Sutcliffe. % 0.19/0.59 % Source : [Tam94] % 0.19/0.59 % Names : Ch12N2 [Tam94] % 0.19/0.59 % 0.19/0.59 % Status : Unsatisfiable % 0.19/0.59 % 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.19/0.59 % Syntax : Number of clauses : 6 ( 0 unt; 2 nHn; 4 RR) % 0.19/0.59 % Number of literals : 14 ( 0 equ; 8 neg) % 0.19/0.59 % Maximal clause size : 3 ( 2 avg) % 0.19/0.59 % Maximal term depth : 2 ( 1 avg) % 0.19/0.59 % Number of predicates : 1 ( 1 usr; 0 prp; 2-2 aty) % 0.19/0.59 % Number of functors : 2 ( 2 usr; 1 con; 0-1 aty) % 0.19/0.59 % Number of variables : 6 ( 0 sgn) % 0.19/0.59 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.19/0.59 % 0.19/0.59 % Comments : All the problems here can be decided by using a certain % 0.19/0.59 % completeness-preserving term ordering strategies. See [FL+93]. % 0.19/0.59 % : The conversion from the full 1st order form in [Chu56] % 0.19/0.59 % to clause form was done by hand by Tanel Tammet. % 0.19/0.59 %-------------------------------------------------------------------------- % 0.19/0.59 cnf(clause1,negated_conjecture, % 0.19/0.59 ( f(Y,a) % 0.19/0.59 | f(a,Y) ) ). % 0.19/0.59 % 0.19/0.59 cnf(clause2,negated_conjecture, % 0.19/0.59 ( f(Y,a) % 0.19/0.59 | ~ f(a,z(Y)) ) ). % 0.19/0.59 % 0.19/0.59 cnf(clause3,negated_conjecture, % 0.19/0.59 ( f(a,z(Y)) % 0.19/0.59 | f(a,Y) ) ). % 0.19/0.59 % 0.19/0.59 cnf(clause4,negated_conjecture, % 0.19/0.59 ( f(a,z(Y)) % 0.19/0.59 | ~ f(Y,a) % 0.19/0.59 | ~ f(z(Y),Y) ) ). % 0.19/0.59 % 0.19/0.59 cnf(clause5,negated_conjecture, % 0.19/0.59 ( ~ f(a,Y) % 0.19/0.59 | ~ f(a,z(Y)) ) ). % 0.19/0.59 % 0.19/0.59 cnf(clause6,negated_conjecture, % 0.19/0.59 ( ~ f(a,Y) % 0.19/0.59 | ~ f(Y,a) % 0.19/0.59 | ~ f(z(Y),Y) ) ). % 0.19/0.59 % 0.19/0.59 %-------------------------------------------------------------------------- % 0.19/0.59 %------------------------------------------- % 0.19/0.59 % Proof found % 0.19/0.59 % SZS status Theorem for theBenchmark % 0.19/0.59 % SZS output start Proof % 0.19/0.59 %ClaNum:6(EqnAxiom:0) % 0.19/0.59 %VarNum:16(SingletonVarNum:6) % 0.19/0.59 %MaxLitNum:3 % 0.19/0.59 %MaxfuncDepth:1 % 0.19/0.59 %SharedTerms:1 % 0.19/0.59 %goalClause: 1 2 3 4 5 6 % 0.19/0.59 [1]P1(a1,x11)+P1(x11,a1) % 0.19/0.59 [2]P1(a1,x21)+P1(a1,f2(x21)) % 0.19/0.59 [3]P1(x31,a1)+~P1(a1,f2(x31)) % 0.19/0.59 [4]~P1(a1,x41)+~P1(a1,f2(x41)) % 0.19/0.59 [5]~P1(x51,a1)+~P1(f2(x51),x51)+P1(a1,f2(x51)) % 0.19/0.59 [6]~P1(a1,x61)+~P1(f2(x61),x61)+~P1(x61,a1) % 0.19/0.59 %EqnAxiom % 0.19/0.59 % 0.19/0.59 %------------------------------------------- % 0.19/0.59 cnf(7,plain, % 0.19/0.59 (~P1(a1,f2(a1))), % 0.19/0.59 inference(scs_inference,[],[1,4])). % 0.19/0.59 cnf(12,plain, % 0.19/0.59 ($false), % 0.19/0.59 inference(scs_inference,[],[7,2,5,1]), % 0.19/0.59 ['proof']). % 0.19/0.59 % SZS output end Proof % 0.19/0.59 % Total time :0.000000s %------------------------------------------------------------------------------