%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN068-1 : 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 : n019.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:26 EDT 2024 % Result : Unsatisfiable 0.55s 0.61s % Output : CNFRefutation 0.55s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN068-1 : TPTP v8.2.0. Released v1.0.0. % 0.07/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n019.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 21:20:24 EDT 2024 % 0.12/0.33 % CPUTime : % 0.20/0.56 start to proof:theBenchmark % 0.20/0.60 %------------------------------------------- % 0.20/0.60 % File :CSE---1.7 % 0.20/0.60 % Problem :theBenchmark % 0.20/0.60 % Transform :cnf % 0.20/0.60 % Format :tptp:raw % 0.20/0.60 % Command :java -jar mcs_scs.jar %d %s % 0.20/0.60 % 0.20/0.60 % Result :Theorem 0.000000s % 0.20/0.60 % Output :CNFRefutation 0.000000s % 0.20/0.60 %------------------------------------------- % 0.55/0.61 %-------------------------------------------------------------------------- % 0.55/0.61 % File : SYN068-1 : TPTP v8.2.0. Released v1.0.0. % 0.55/0.61 % Domain : Syntactic % 0.55/0.61 % Problem : Pelletier Problem 44 % 0.55/0.61 % Version : Especial. % 0.55/0.61 % English : % 0.55/0.61 % 0.55/0.61 % Refs : [KM64] Kalish & Montegue (1964), Logic: Techniques of Formal % 0.55/0.61 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au % 0.55/0.61 % Source : [Pel86] % 0.55/0.61 % Names : Pelletier 44 [Pel86] % 0.55/0.61 % : p44.in [ANL] % 0.55/0.61 % 0.55/0.61 % Status : Unsatisfiable % 0.55/0.61 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v2.0.0 % 0.55/0.61 % Syntax : Number of clauses : 7 ( 1 unt; 0 nHn; 7 RR) % 0.55/0.61 % Number of literals : 13 ( 0 equ; 7 neg) % 0.55/0.61 % Maximal clause size : 2 ( 1 avg) % 0.55/0.61 % Maximal term depth : 2 ( 1 avg) % 0.55/0.61 % Number of predicates : 4 ( 4 usr; 0 prp; 1-2 aty) % 0.55/0.61 % Number of functors : 3 ( 3 usr; 1 con; 0-1 aty) % 0.55/0.61 % Number of variables : 6 ( 0 sgn) % 0.55/0.61 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.55/0.61 % 0.55/0.61 % Comments : % 0.55/0.61 %-------------------------------------------------------------------------- % 0.55/0.61 cnf(clause_1,axiom, % 0.55/0.61 ( ~ big_f(X) % 0.55/0.61 | big_g(f(X)) ) ). % 0.55/0.61 % 0.55/0.61 cnf(clause_2,axiom, % 0.55/0.61 ( ~ big_f(X) % 0.55/0.61 | big_h(X,f(X)) ) ). % 0.55/0.61 % 0.55/0.61 cnf(clause_3,axiom, % 0.55/0.61 ( ~ big_f(X) % 0.55/0.61 | big_g(g(X)) ) ). % 0.55/0.61 % 0.55/0.61 cnf(clause_4,axiom, % 0.55/0.61 ( ~ big_f(X) % 0.55/0.61 | ~ big_h(X,g(X)) ) ). % 0.55/0.61 % 0.55/0.61 cnf(clause_5,axiom, % 0.55/0.61 big_j(a) ). % 0.55/0.61 % 0.55/0.61 cnf(clause_6,axiom, % 0.55/0.61 ( ~ big_g(X) % 0.55/0.61 | big_h(a,X) ) ). % 0.55/0.61 % 0.55/0.61 cnf(clause_7,negated_conjecture, % 0.55/0.61 ( ~ big_j(X) % 0.55/0.61 | big_f(X) ) ). % 0.55/0.61 % 0.55/0.61 %-------------------------------------------------------------------------- % 0.55/0.61 %------------------------------------------- % 0.55/0.61 % Proof found % 0.55/0.61 % SZS status Theorem for theBenchmark % 0.55/0.61 % SZS output start Proof % 0.55/0.61 %ClaNum:7(EqnAxiom:0) % 0.55/0.61 %VarNum:14(SingletonVarNum:6) % 0.55/0.61 %MaxLitNum:2 % 0.55/0.61 %MaxfuncDepth:1 % 0.55/0.61 %SharedTerms:2 % 0.55/0.61 %goalClause: 2 % 0.55/0.61 [1]P1(a1) % 0.55/0.61 [2]~P1(x21)+P2(x21) % 0.55/0.61 [5]~P3(x51)+P4(a1,x51) % 0.55/0.61 [3]~P2(x31)+P3(f2(x31)) % 0.55/0.61 [4]~P2(x41)+P3(f3(x41)) % 0.55/0.61 [6]~P2(x61)+P4(x61,f2(x61)) % 0.55/0.61 [7]~P2(x71)+~P4(x71,f3(x71)) % 0.55/0.61 %EqnAxiom % 0.55/0.61 % 0.55/0.61 %------------------------------------------- % 0.55/0.61 cnf(9,plain, % 0.55/0.61 (P3(f3(a1))), % 0.55/0.61 inference(scs_inference,[],[1,4,2])). % 0.55/0.61 cnf(11,plain, % 0.55/0.61 (~P4(a1,f3(a1))), % 0.55/0.61 inference(scs_inference,[],[1,7,2])). % 0.55/0.61 cnf(12,plain, % 0.55/0.61 ($false), % 0.55/0.61 inference(scs_inference,[],[9,11,5]), % 0.55/0.61 ['proof']). % 0.55/0.61 % SZS output end Proof % 0.55/0.61 % Total time :0.000000s %------------------------------------------------------------------------------