%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN032-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 : n022.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:16 EDT 2024 % Result : Unsatisfiable 0.53s 0.59s % Output : CNFRefutation 0.53s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SYN032-1 : 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.12/0.33 % Computer : n022.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 18:48:08 EDT 2024 % 0.12/0.33 % CPUTime : % 0.50/0.56 start to proof:theBenchmark % 0.53/0.59 %------------------------------------------- % 0.53/0.59 % File :CSE---1.7 % 0.53/0.59 % Problem :theBenchmark % 0.53/0.59 % Transform :cnf % 0.53/0.59 % Format :tptp:raw % 0.53/0.59 % Command :java -jar mcs_scs.jar %d %s % 0.53/0.59 % 0.53/0.59 % Result :Theorem 0.000000s % 0.53/0.59 % Output :CNFRefutation 0.000000s % 0.53/0.59 %------------------------------------------- % 0.53/0.59 %-------------------------------------------------------------------------- % 0.53/0.59 % File : SYN032-1 : TPTP v8.2.0. Released v1.0.0. % 0.53/0.59 % Domain : Syntactic % 0.53/0.59 % Problem : Ances % 0.53/0.59 % Version : Especial. % 0.53/0.59 % English : % 0.53/0.59 % 0.53/0.59 % Refs : [RR+72] Reboh et al. (1972), Study of automatic theorem provin % 0.53/0.59 % Source : [SPRFN] % 0.53/0.59 % Names : ANCES2 [RR+72] % 0.53/0.59 % 0.53/0.59 % Status : Unsatisfiable % 0.53/0.59 % Rating : 0.00 v2.0.0 % 0.53/0.59 % Syntax : Number of clauses : 7 ( 0 unt; 3 nHn; 7 RR) % 0.53/0.59 % Number of literals : 17 ( 0 equ; 8 neg) % 0.53/0.59 % Maximal clause size : 3 ( 2 avg) % 0.53/0.59 % Maximal term depth : 0 ( 0 avg) % 0.53/0.59 % Number of predicates : 6 ( 6 usr; 6 prp; 0-0 aty) % 0.53/0.59 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.53/0.59 % Number of variables : 0 ( 0 sgn) % 0.53/0.59 % SPC : CNF_UNS_PRP % 0.53/0.59 % 0.53/0.59 % Comments : % 0.53/0.59 %-------------------------------------------------------------------------- % 0.53/0.59 cnf(three,hypothesis, % 0.53/0.59 ( h % 0.53/0.59 | a % 0.53/0.59 | ~ j ) ). % 0.53/0.59 % 0.53/0.59 cnf(four,hypothesis, % 0.53/0.59 ( h % 0.53/0.59 | k % 0.53/0.59 | j ) ). % 0.53/0.59 % 0.53/0.59 cnf(five,hypothesis, % 0.53/0.59 ( h % 0.53/0.59 | j % 0.53/0.59 | ~ k ) ). % 0.53/0.59 % 0.53/0.59 cnf(six,hypothesis, % 0.53/0.59 ( b % 0.53/0.59 | ~ a ) ). % 0.53/0.59 % 0.53/0.59 cnf(seven,hypothesis, % 0.53/0.59 ( c % 0.53/0.59 | ~ h ) ). % 0.53/0.59 % 0.53/0.59 cnf(one,hypothesis, % 0.53/0.59 ( ~ h % 0.53/0.59 | ~ c ) ). % 0.53/0.59 % 0.53/0.59 cnf(prove_something,negated_conjecture, % 0.53/0.59 ( ~ a % 0.53/0.59 | ~ b ) ). % 0.53/0.59 % 0.53/0.59 %-------------------------------------------------------------------------- % 0.53/0.59 %------------------------------------------- % 0.53/0.59 % Proof found % 0.53/0.59 % SZS status Theorem for theBenchmark % 0.53/0.59 % SZS output start Proof % 0.53/0.59 %ClaNum:7(EqnAxiom:0) % 0.53/0.59 %VarNum:0(SingletonVarNum:0) % 0.53/0.59 %MaxLitNum:3 % 0.53/0.59 %MaxfuncDepth:0 % 0.53/0.59 %SharedTerms:13 % 0.53/0.59 %goalClause: 5 % 0.53/0.59 [1]P1(a5000)+~P2(a5000) % 0.53/0.59 [2]P3(a5000)+~P4(a5000) % 0.53/0.59 [4]~P4(a5000)+~P3(a5000) % 0.53/0.59 [5]~P2(a5000)+~P1(a5000) % 0.53/0.59 [3]P4(a5000)+P5(a5000)+P6(a5000) % 0.53/0.59 [6]P4(a5000)+P2(a5000)+~P5(a5000) % 0.53/0.59 [7]P4(a5000)+P5(a5000)+~P6(a5000) % 0.53/0.59 %EqnAxiom % 0.53/0.59 % 0.53/0.59 %------------------------------------------- % 0.53/0.60 cnf(8,plain, % 0.53/0.60 (~P2(a5000)), % 0.53/0.60 inference(scs_inference,[],[1,5])). % 0.53/0.60 cnf(9,plain, % 0.53/0.60 (P4(a5000)+~P5(a5000)), % 0.53/0.60 inference(scs_inference,[],[8,6])). % 0.53/0.60 cnf(10,plain, % 0.53/0.60 (~P4(a5000)), % 0.53/0.60 inference(scs_inference,[],[2,4])). % 0.53/0.60 cnf(11,plain, % 0.53/0.60 (P5(a5000)+P6(a5000)), % 0.53/0.60 inference(scs_inference,[],[10,3])). % 0.53/0.60 cnf(12,plain, % 0.53/0.60 (P5(a5000)+~P6(a5000)), % 0.53/0.60 inference(scs_inference,[],[10,7])). % 0.53/0.60 cnf(13,plain, % 0.53/0.60 (~P5(a5000)), % 0.53/0.60 inference(scs_inference,[],[10,9])). % 0.53/0.60 cnf(14,plain, % 0.53/0.60 ($false), % 0.53/0.60 inference(scs_inference,[],[13,11,12]), % 0.53/0.60 ['proof']). % 0.53/0.60 % SZS output end Proof % 0.53/0.60 % Total time :0.000000s %------------------------------------------------------------------------------