TSTP Solution File: SYN066-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SYN066-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n002.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 : Fri Sep 1 01:43:59 EDT 2023
% Result : Unsatisfiable 0.22s 0.62s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN066-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.14/0.35 % Computer : n002.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 20:02:18 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.22/0.57 start to proof:theBenchmark
% 0.22/0.62 %-------------------------------------------
% 0.22/0.62 % File :CSE---1.6
% 0.22/0.62 % Problem :theBenchmark
% 0.22/0.62 % Transform :cnf
% 0.22/0.62 % Format :tptp:raw
% 0.22/0.62 % Command :java -jar mcs_scs.jar %d %s
% 0.22/0.62
% 0.22/0.62 % Result :Theorem 0.000000s
% 0.22/0.62 % Output :CNFRefutation 0.000000s
% 0.22/0.62 %-------------------------------------------
% 0.22/0.62 %--------------------------------------------------------------------------
% 0.22/0.62 % File : SYN066-1 : TPTP v8.1.2. Released v1.0.0.
% 0.22/0.62 % Domain : Syntactic
% 0.22/0.62 % Problem : Pelletier Problem 37
% 0.22/0.62 % Version : Especial.
% 0.22/0.62 % English :
% 0.22/0.62
% 0.22/0.62 % Refs : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au
% 0.22/0.62 % Source : [Pel86]
% 0.22/0.62 % Names : Pelletier 37 [Pel86]
% 0.22/0.62 % : p37.in [ANL]
% 0.22/0.62
% 0.22/0.62 % Status : Unsatisfiable
% 0.22/0.62 % Rating : 0.00 v7.1.0, 0.17 v7.0.0, 0.12 v6.3.0, 0.14 v6.2.0, 0.00 v2.0.0
% 0.22/0.62 % Syntax : Number of clauses : 6 ( 2 unt; 1 nHn; 3 RR)
% 0.22/0.62 % Number of literals : 10 ( 0 equ; 4 neg)
% 0.22/0.62 % Maximal clause size : 2 ( 1 avg)
% 0.22/0.62 % Maximal term depth : 2 ( 1 avg)
% 0.22/0.62 % Number of predicates : 3 ( 3 usr; 0 prp; 2-2 aty)
% 0.22/0.62 % Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% 0.22/0.62 % Number of variables : 12 ( 4 sgn)
% 0.22/0.62 % SPC : CNF_UNS_RFO_NEQ_NHN
% 0.22/0.62
% 0.22/0.62 % Comments :
% 0.22/0.62 %--------------------------------------------------------------------------
% 0.22/0.62 cnf(clause_1,axiom,
% 0.22/0.62 ( ~ big_p(Y,X)
% 0.22/0.62 | big_p(f(X,Y),g(X)) ) ).
% 0.22/0.62
% 0.22/0.62 cnf(clause_2,axiom,
% 0.22/0.62 big_p(f(X,Y),X) ).
% 0.22/0.62
% 0.22/0.62 cnf(clause_3,axiom,
% 0.22/0.62 ( ~ big_p(f(X,Y),g(X))
% 0.22/0.62 | big_q(h(X,Y),g(X)) ) ).
% 0.22/0.62
% 0.22/0.62 cnf(clause_4,axiom,
% 0.22/0.62 ( big_p(X,Y)
% 0.22/0.62 | big_q(i(X,Y),X) ) ).
% 0.22/0.62
% 0.22/0.62 cnf(clause_5,axiom,
% 0.22/0.62 ( ~ big_q(X,Y)
% 0.22/0.62 | big_r(Z,Z) ) ).
% 0.22/0.62
% 0.22/0.62 cnf(clause_6,negated_conjecture,
% 0.22/0.62 ~ big_r(a,Z) ).
% 0.22/0.62
% 0.22/0.62 %--------------------------------------------------------------------------
% 0.22/0.62 %-------------------------------------------
% 0.22/0.62 % Proof found
% 0.22/0.62 % SZS status Theorem for theBenchmark
% 0.22/0.62 % SZS output start Proof
% 0.22/0.62 %ClaNum:6(EqnAxiom:0)
% 0.22/0.62 %VarNum:24(SingletonVarNum:12)
% 0.22/0.62 %MaxLitNum:2
% 0.22/0.62 %MaxfuncDepth:1
% 0.22/0.62 %SharedTerms:1
% 0.22/0.62 %goalClause: 2
% 0.22/0.62 %singleGoalClaCount:1
% 0.22/0.62 [2]~P2(a2,x21)
% 0.22/0.62 [1]P1(f1(x11,x12),x11)
% 0.22/0.62 [4]P1(x41,x42)+P3(f3(x41,x42),x41)
% 0.22/0.62 [5]~P1(x52,x51)+P1(f1(x51,x52),f4(x51))
% 0.22/0.62 [6]~P1(f1(x61,x62),f4(x61))+P3(f5(x61,x62),f4(x61))
% 0.22/0.62 [3]P2(x31,x31)+~P3(x32,x33)
% 0.22/0.62 %EqnAxiom
% 0.22/0.62
% 0.22/0.62 %-------------------------------------------
% 0.22/0.63 cnf(7,plain,
% 0.22/0.63 (~P3(x71,x72)),
% 0.22/0.63 inference(scs_inference,[],[2,3])).
% 0.22/0.63 cnf(9,plain,
% 0.22/0.63 (P3(f5(x91,x92),f4(x91))),
% 0.22/0.63 inference(scs_inference,[],[2,3,4,6])).
% 0.22/0.63 cnf(10,plain,
% 0.22/0.63 ($false),
% 0.22/0.63 inference(scs_inference,[],[7,9]),
% 0.22/0.63 ['proof']).
% 0.22/0.63 % SZS output end Proof
% 0.22/0.63 % Total time :0.000000s
%------------------------------------------------------------------------------