%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN006-1 : TPTP v8.2.0. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % Computer : n024.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:13 EDT 2024 % Result : Unsatisfiable 0.54s 0.62s % Output : CNFRefutation 0.54s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN006-1 : TPTP v8.2.0. Released v1.0.0. % 0.07/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n024.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 23:22:09 EDT 2024 % 0.12/0.33 % CPUTime : % 0.19/0.58 start to proof:theBenchmark % 0.54/0.61 %------------------------------------------- % 0.54/0.61 % File :CSE---1.7 % 0.54/0.61 % Problem :theBenchmark % 0.54/0.61 % Transform :cnf % 0.54/0.61 % Format :tptp:raw % 0.54/0.61 % Command :java -jar mcs_scs.jar %d %s % 0.54/0.61 % 0.54/0.61 % Result :Theorem 0.000000s % 0.54/0.61 % Output :CNFRefutation 0.000000s % 0.54/0.61 %------------------------------------------- % 0.54/0.62 %-------------------------------------------------------------------------- % 0.54/0.62 % File : SYN006-1 : TPTP v8.2.0. Released v1.0.0. % 0.54/0.62 % Domain : Syntactic % 0.54/0.62 % Problem : A problem to demonstrate controlling splits % 0.54/0.62 % Version : Especial. % 0.54/0.62 % English : % 0.54/0.62 % 0.54/0.62 % Refs : [Pla82] Plaisted (1982), A Simplified Problem Reduction Format % 0.54/0.62 % Source : [Pla82] % 0.54/0.62 % Names : Problem 5.8 [Pla82] % 0.54/0.62 % 0.54/0.62 % Status : Unsatisfiable % 0.54/0.62 % Rating : 0.00 v6.3.0, 0.14 v6.2.0, 0.00 v2.0.0 % 0.54/0.62 % Syntax : Number of clauses : 7 ( 4 unt; 2 nHn; 6 RR) % 0.54/0.62 % Number of literals : 12 ( 0 equ; 6 neg) % 0.54/0.62 % Maximal clause size : 3 ( 1 avg) % 0.54/0.62 % Maximal term depth : 4 ( 1 avg) % 0.54/0.62 % Number of predicates : 6 ( 6 usr; 0 prp; 2-2 aty) % 0.54/0.62 % Number of functors : 3 ( 3 usr; 1 con; 0-1 aty) % 0.54/0.62 % Number of variables : 13 ( 7 sgn) % 0.54/0.62 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.54/0.62 % 0.54/0.62 % Comments : % 0.54/0.62 %-------------------------------------------------------------------------- % 0.54/0.62 cnf(clause_1,negated_conjecture, % 0.54/0.62 ( ~ p1(X,f(Y)) % 0.54/0.62 | q1(f(X),Y) % 0.54/0.62 | q2(X,f(Y)) ) ). % 0.54/0.62 % 0.54/0.62 cnf(clause_2,negated_conjecture, % 0.54/0.62 p1(a,Y) ). % 0.54/0.62 % 0.54/0.62 cnf(clause_3,negated_conjecture, % 0.54/0.62 ~ q2(X,f(Y)) ). % 0.54/0.62 % 0.54/0.62 cnf(clause_4,negated_conjecture, % 0.54/0.62 ( ~ p2(X,f(Y)) % 0.54/0.62 | q3(f(X),Y) % 0.54/0.62 | q4(X,f(Y)) ) ). % 0.54/0.62 % 0.54/0.62 cnf(clause_5,negated_conjecture, % 0.54/0.62 ~ q3(X,g(Y)) ). % 0.54/0.62 % 0.54/0.62 cnf(clause_6,negated_conjecture, % 0.54/0.62 ~ q4(f(f(X)),f(g(f(Y)))) ). % 0.54/0.62 % 0.54/0.62 cnf(clause_7,negated_conjecture, % 0.54/0.62 ( ~ q1(X,f(Y)) % 0.54/0.62 | p2(f(X),Y) ) ). % 0.54/0.62 % 0.54/0.62 %-------------------------------------------------------------------------- % 0.54/0.62 %------------------------------------------- % 0.54/0.62 % Proof found % 0.54/0.62 % SZS status Theorem for theBenchmark % 0.54/0.62 % SZS output start Proof % 0.54/0.62 %ClaNum:7(EqnAxiom:0) % 0.54/0.62 %VarNum:23(SingletonVarNum:13) % 0.54/0.62 %MaxLitNum:3 % 0.54/0.62 %MaxfuncDepth:3 % 0.54/0.62 %SharedTerms:1 % 0.54/0.62 %goalClause: 1 2 3 4 5 6 7 % 0.54/0.62 %singleGoalClaCount:4 % 0.54/0.62 [1]P1(a1,x11) % 0.54/0.62 [2]~P2(x21,f2(x22)) % 0.54/0.62 [3]~P5(x31,f3(x32)) % 0.54/0.62 [4]~P6(f2(f2(x41)),f2(f3(f2(x42)))) % 0.54/0.62 [5]~P4(x51,f2(x52))+P3(f2(x51),x52) % 0.54/0.62 [6]P4(f2(x61),x62)+P2(x61,f2(x62))+~P1(x61,f2(x62)) % 0.54/0.62 [7]P5(f2(x71),x72)+P6(x71,f2(x72))+~P3(x71,f2(x72)) % 0.54/0.62 %EqnAxiom % 0.54/0.62 % 0.54/0.62 %------------------------------------------- % 0.54/0.62 cnf(15,plain, % 0.54/0.62 ($false), % 0.54/0.62 inference(scs_inference,[],[1,2,3,4,6,7,5]), % 0.54/0.62 ['proof']). % 0.54/0.62 % SZS output end Proof % 0.54/0.62 % Total time :0.000000s %------------------------------------------------------------------------------