%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN002-1.007.008 : 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 : n020.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:04:12 EDT 2024 % Result : Unsatisfiable 0.52s 0.61s % Output : CNFRefutation 0.52s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SYN002-1.007.008 : TPTP v8.2.0. Released v1.0.0. % 0.03/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.13/0.33 % Computer : n020.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Sun Jun 23 21:37:39 EDT 2024 % 0.13/0.33 % CPUTime : % 0.51/0.56 start to proof:theBenchmark % 0.52/0.60 %------------------------------------------- % 0.52/0.60 % File :CSE---1.7 % 0.52/0.60 % Problem :theBenchmark % 0.52/0.60 % Transform :cnf % 0.52/0.60 % Format :tptp:raw % 0.52/0.60 % Command :java -jar mcs_scs.jar %d %s % 0.52/0.60 % 0.52/0.60 % Result :Theorem 0.000000s % 0.52/0.60 % Output :CNFRefutation 0.000000s % 0.52/0.60 %------------------------------------------- % 0.52/0.61 %-------------------------------------------------------------------------- % 0.52/0.61 % File : SYN002-1.007.008 : TPTP v8.2.0. Released v1.0.0. % 0.52/0.61 % Domain : Syntactic % 0.52/0.61 % Problem : Odd and Even Problem % 0.52/0.61 % Version : Especial. % 0.52/0.61 % English : Given by the clauses C1: p(X) v p(f^M(X)) and C2: ~p(X) % 0.52/0.61 % v ~p(f^N(X)), where if M is odd N is even and vice versa, % 0.52/0.61 % N > M. The sizes are used for N and M. % 0.52/0.61 % 0.52/0.61 % Refs : [Soc92] Socher-Ambrosius (1992), How to Avoid the Derivation o % 0.52/0.61 % Source : [Soc92] % 0.52/0.61 % Names : ederX-Y.lop (Size X:Y) [TUM] % 0.52/0.61 % 0.52/0.61 % Status : Unsatisfiable % 0.52/0.61 % Rating : 0.00 v6.3.0, 0.14 v6.2.0, 0.00 v3.1.0, 0.17 v2.7.0, 0.12 v2.6.0, 0.00 v2.1.0 % 0.52/0.61 % Syntax : Number of clauses : 2 ( 0 unt; 1 nHn; 1 RR) % 0.52/0.61 % Number of literals : 4 ( 0 equ; 2 neg) % 0.52/0.61 % Maximal clause size : 2 ( 2 avg) % 0.52/0.61 % Maximal term depth : 9 ( 4 avg) % 0.52/0.61 % Number of predicates : 1 ( 1 usr; 0 prp; 1-1 aty) % 0.52/0.61 % Number of functors : 1 ( 1 usr; 0 con; 1-1 aty) % 0.52/0.61 % Number of variables : 2 ( 0 sgn) % 0.52/0.61 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.52/0.61 % 0.52/0.61 % Comments : % 0.52/0.61 % : tptp2X: -f tptp -s7:8 SYN002-1.g % 0.52/0.61 %-------------------------------------------------------------------------- % 0.52/0.61 cnf(positive,negated_conjecture, % 0.52/0.61 ( p(X) % 0.52/0.61 | p(f(f(f(f(f(f(f(X)))))))) ) ). % 0.52/0.61 % 0.52/0.61 cnf(negative,negated_conjecture, % 0.52/0.61 ( ~ p(X) % 0.52/0.61 | ~ p(f(f(f(f(f(f(f(f(X))))))))) ) ). % 0.52/0.61 % 0.52/0.61 %-------------------------------------------------------------------------- % 0.52/0.61 %------------------------------------------- % 0.52/0.61 % Proof found % 0.52/0.61 % SZS status Theorem for theBenchmark % 0.52/0.61 % SZS output start Proof % 0.52/0.61 %ClaNum:2(EqnAxiom:0) % 0.52/0.61 %VarNum:4(SingletonVarNum:2) % 0.52/0.61 %MaxLitNum:2 % 0.52/0.61 %MaxfuncDepth:8 % 0.52/0.61 %SharedTerms:0 % 0.52/0.61 %goalClause: 1 2 % 0.52/0.61 [1]P1(x11)+P1(f1(f1(f1(f1(f1(f1(f1(x11)))))))) % 0.52/0.61 [2]~P1(x21)+~P1(f1(f1(f1(f1(f1(f1(f1(f1(x21))))))))) % 0.52/0.61 %EqnAxiom % 0.52/0.61 % 0.52/0.61 %------------------------------------------- % 0.52/0.62 cnf(3,plain, % 0.52/0.62 (P1(f1(f1(f1(f1(f1(f1(f1(x31))))))))+~P1(f1(f1(f1(f1(f1(f1(f1(f1(x31)))))))))), % 0.52/0.62 inference(scs_inference,[],[1,2])). % 0.52/0.62 cnf(4,plain, % 0.52/0.62 (P1(f1(f1(f1(f1(f1(f1(f1(x41))))))))+P1(f1(x41))), % 0.52/0.62 inference(scs_inference,[],[3,1])). % 0.52/0.62 cnf(5,plain, % 0.52/0.62 (P1(f1(f1(x51)))+~P1(x51)), % 0.52/0.62 inference(scs_inference,[],[4,2])). % 0.52/0.62 cnf(6,plain, % 0.52/0.62 (P1(f1(f1(f1(x61))))+P1(f1(f1(f1(f1(f1(f1(f1(x61))))))))), % 0.52/0.62 inference(scs_inference,[],[5,4])). % 0.52/0.62 cnf(7,plain, % 0.52/0.62 (P1(f1(f1(f1(f1(x71)))))+~P1(x71)), % 0.52/0.62 inference(scs_inference,[],[6,2])). % 0.52/0.62 cnf(8,plain, % 0.52/0.62 (~P1(x81)+P1(f1(f1(f1(f1(f1(f1(x81)))))))), % 0.52/0.62 inference(scs_inference,[],[7,5])). % 0.52/0.62 cnf(9,plain, % 0.52/0.62 (~P1(f1(f1(x91)))+P1(f1(f1(f1(f1(f1(f1(f1(x91))))))))), % 0.52/0.62 inference(scs_inference,[],[8,3])). % 0.52/0.62 cnf(10,plain, % 0.52/0.62 (P1(f1(f1(f1(f1(f1(f1(f1(x101))))))))+P1(f1(f1(f1(f1(f1(f1(f1(f1(x101)))))))))), % 0.52/0.62 inference(scs_inference,[],[9,4])). % 0.52/0.62 cnf(11,plain, % 0.52/0.62 (P1(f1(f1(f1(f1(f1(f1(f1(x111))))))))+~P1(x111)), % 0.52/0.62 inference(scs_inference,[],[10,2])). % 0.52/0.62 cnf(12,plain, % 0.52/0.62 (P1(f1(f1(f1(f1(f1(f1(f1(x121))))))))), % 0.52/0.62 inference(scs_inference,[],[11,1])). % 0.52/0.62 cnf(14,plain, % 0.52/0.62 (P1(f1(f1(f1(f1(f1(f1(f1(x141))))))))), % 0.52/0.62 inference(rename_variables,[],[12])). % 0.52/0.62 cnf(15,plain, % 0.52/0.62 ($false), % 0.52/0.62 inference(scs_inference,[],[12,14,2,5]), % 0.52/0.62 ['proof']). % 0.52/0.62 % SZS output end Proof % 0.52/0.62 % Total time :0.000000s %------------------------------------------------------------------------------