%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN315-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 : n029.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:07 EDT 2024 % Result : Unsatisfiable 0.51s 0.59s % Output : CNFRefutation 0.51s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.09/0.11 % Problem : SYN315-1 : TPTP v8.2.0. Released v1.2.0. % 0.09/0.11 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.10/0.31 % Computer : n029.cluster.edu % 0.10/0.31 % Model : x86_64 x86_64 % 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.31 % Memory : 8042.1875MB % 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.31 % CPULimit : 300 % 0.10/0.31 % WCLimit : 300 % 0.10/0.31 % DateTime : Sun Jun 23 23:00:53 EDT 2024 % 0.16/0.32 % CPUTime : % 0.51/0.55 start to proof:theBenchmark % 0.51/0.58 %------------------------------------------- % 0.51/0.58 % File :CSE---1.7 % 0.51/0.58 % Problem :theBenchmark % 0.51/0.58 % Transform :cnf % 0.51/0.58 % Format :tptp:raw % 0.51/0.58 % Command :java -jar mcs_scs.jar %d %s % 0.51/0.58 % 0.51/0.58 % Result :Theorem 0.000000s % 0.51/0.58 % Output :CNFRefutation 0.000000s % 0.51/0.58 %------------------------------------------- % 0.51/0.58 %-------------------------------------------------------------------------- % 0.51/0.58 % File : SYN315-1 : TPTP v8.2.0. Released v1.2.0. % 0.51/0.58 % Domain : Syntactic % 0.51/0.58 % Problem : Church problem 46.2 (1) % 0.51/0.58 % Version : Especial. % 0.51/0.58 % English : % 0.51/0.58 % 0.51/0.58 % Refs : [Chu56] Church (1956), Introduction to Mathematical Logic I % 0.51/0.58 % : [FL+93] Fermuller et al. (1993), Resolution Methods for the De % 0.51/0.58 % : [Tam94] Tammet (1994), Email to Geoff Sutcliffe. % 0.51/0.58 % Source : [Tam94] % 0.51/0.58 % Names : Ch2N1 [Tam94] % 0.51/0.58 % 0.51/0.58 % Status : Unsatisfiable % 0.51/0.58 % Rating : 0.00 v2.0.0 % 0.51/0.58 % Syntax : Number of clauses : 4 ( 0 unt; 1 nHn; 2 RR) % 0.51/0.58 % Number of literals : 8 ( 0 equ; 4 neg) % 0.51/0.58 % Maximal clause size : 2 ( 2 avg) % 0.51/0.58 % Maximal term depth : 2 ( 1 avg) % 0.51/0.58 % Number of predicates : 2 ( 2 usr; 0 prp; 1-1 aty) % 0.51/0.58 % Number of functors : 2 ( 2 usr; 1 con; 0-1 aty) % 0.51/0.58 % Number of variables : 4 ( 4 sgn) % 0.51/0.58 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.51/0.58 % 0.51/0.58 % Comments : All the problems here can be decided by using a certain % 0.51/0.58 % completeness-preserving term ordering strategies. See [FL+93]. % 0.51/0.59 % : The conversion from the full 1st order form in [Chu56] % 0.51/0.59 % to clause form was done by hand by Tanel Tammet. % 0.51/0.59 %-------------------------------------------------------------------------- % 0.51/0.59 cnf(clause1,negated_conjecture, % 0.51/0.59 ( ~ f(X) % 0.51/0.59 | p(a) ) ). % 0.51/0.59 % 0.51/0.59 cnf(clause2,negated_conjecture, % 0.51/0.59 ( ~ p(a) % 0.51/0.59 | f(X) ) ). % 0.51/0.59 % 0.51/0.59 cnf(clause3,negated_conjecture, % 0.51/0.59 ( ~ f(y(X)) % 0.51/0.59 | ~ p(a) ) ). % 0.51/0.59 % 0.51/0.59 cnf(clause4,negated_conjecture, % 0.51/0.59 ( p(a) % 0.51/0.59 | f(y(X)) ) ). % 0.51/0.59 % 0.51/0.59 %-------------------------------------------------------------------------- % 0.51/0.59 %------------------------------------------- % 0.51/0.59 % Proof found % 0.51/0.59 % SZS status Theorem for theBenchmark % 0.51/0.59 % SZS output start Proof % 0.51/0.59 %ClaNum:4(EqnAxiom:0) % 0.51/0.59 %VarNum:4(SingletonVarNum:4) % 0.51/0.59 %MaxLitNum:2 % 0.51/0.59 %MaxfuncDepth:1 % 0.51/0.59 %SharedTerms:3 % 0.51/0.59 %goalClause: 1 2 3 4 % 0.51/0.59 [1]P1(x11)+~P2(a1) % 0.51/0.59 [2]~P1(x21)+P2(a1) % 0.51/0.59 [3]P2(a1)+P1(f2(x31)) % 0.51/0.59 [4]~P2(a1)+~P1(f2(x41)) % 0.51/0.59 %EqnAxiom % 0.51/0.59 % 0.51/0.59 %------------------------------------------- % 0.51/0.59 cnf(6,plain, % 0.51/0.59 (P1(x61)+P1(f2(x62))), % 0.51/0.59 inference(scs_inference,[],[3,1])). % 0.51/0.59 cnf(7,plain, % 0.51/0.59 (~P1(x71)+~P1(f2(x72))), % 0.51/0.59 inference(scs_inference,[],[4,2])). % 0.51/0.59 cnf(8,plain, % 0.51/0.59 (~P1(x81)), % 0.51/0.59 inference(scs_inference,[],[6,7])). % 0.51/0.59 cnf(11,plain, % 0.51/0.59 ($false), % 0.51/0.59 inference(scs_inference,[],[8,6]), % 0.51/0.59 ['proof']). % 0.51/0.59 % SZS output end Proof % 0.51/0.59 % Total time :0.000000s %------------------------------------------------------------------------------