TSTP Solution File: SYN060-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SYN060-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% Computer : n007.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:56 EDT 2023
% Result : Unsatisfiable 0.20s 0.64s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN060-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.14/0.34 % Computer : n007.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 18:57:56 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.59 start to proof:theBenchmark
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 % File :CSE---1.6
% 0.20/0.63 % Problem :theBenchmark
% 0.20/0.63 % Transform :cnf
% 0.20/0.63 % Format :tptp:raw
% 0.20/0.63 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.63
% 0.20/0.63 % Result :Theorem 0.000000s
% 0.20/0.63 % Output :CNFRefutation 0.000000s
% 0.20/0.63 %-------------------------------------------
% 0.20/0.64 %--------------------------------------------------------------------------
% 0.20/0.64 % File : SYN060-1 : TPTP v8.1.2. Released v1.0.0.
% 0.20/0.64 % Domain : Syntactic
% 0.20/0.64 % Problem : Pelletier Problem 30
% 0.20/0.64 % Version : Especial.
% 0.20/0.64 % English :
% 0.20/0.64
% 0.20/0.64 % Refs : [KM64] Kalish & Montegue (1964), Logic: Techniques of Formal
% 0.20/0.64 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au
% 0.20/0.64 % Source : [Pel86]
% 0.20/0.64 % Names : Pelletier 30 [Pel86]
% 0.20/0.64
% 0.20/0.64 % Status : Unsatisfiable
% 0.20/0.64 % Rating : 0.00 v2.0.0
% 0.20/0.64 % Syntax : Number of clauses : 7 ( 1 unt; 4 nHn; 3 RR)
% 0.20/0.64 % Number of literals : 13 ( 0 equ; 5 neg)
% 0.20/0.64 % Maximal clause size : 2 ( 1 avg)
% 0.20/0.64 % Maximal term depth : 1 ( 1 avg)
% 0.20/0.64 % Number of predicates : 4 ( 4 usr; 0 prp; 1-1 aty)
% 0.20/0.64 % Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% 0.20/0.64 % Number of variables : 6 ( 0 sgn)
% 0.20/0.64 % SPC : CNF_UNS_EPR_NEQ_NHN
% 0.20/0.64
% 0.20/0.64 % Comments :
% 0.20/0.64 %--------------------------------------------------------------------------
% 0.20/0.64 cnf(clause_1,axiom,
% 0.20/0.64 ( ~ big_f(X)
% 0.20/0.64 | ~ big_h(X) ) ).
% 0.20/0.64
% 0.20/0.64 cnf(clause_2,axiom,
% 0.20/0.64 ( big_g(X)
% 0.20/0.64 | big_f(X) ) ).
% 0.20/0.64
% 0.20/0.64 cnf(clause_3,axiom,
% 0.20/0.64 ( ~ big_g(X)
% 0.20/0.64 | ~ big_h(X) ) ).
% 0.20/0.64
% 0.20/0.64 cnf(clause_4,axiom,
% 0.20/0.64 ( big_g(X)
% 0.20/0.64 | big_h(X) ) ).
% 0.20/0.64
% 0.20/0.64 cnf(clause_5,axiom,
% 0.20/0.64 ( big_i(X)
% 0.20/0.64 | big_f(X) ) ).
% 0.20/0.64
% 0.20/0.64 cnf(clause_6,axiom,
% 0.20/0.64 ( big_i(X)
% 0.20/0.64 | big_h(X) ) ).
% 0.20/0.64
% 0.20/0.64 cnf(clause_7,negated_conjecture,
% 0.20/0.64 ~ big_i(a) ).
% 0.20/0.64
% 0.20/0.64 %--------------------------------------------------------------------------
% 0.20/0.64 %-------------------------------------------
% 0.20/0.64 % Proof found
% 0.20/0.64 % SZS status Theorem for theBenchmark
% 0.20/0.64 % SZS output start Proof
% 0.20/0.64 %ClaNum:7(EqnAxiom:0)
% 0.20/0.64 %VarNum:12(SingletonVarNum:6)
% 0.20/0.64 %MaxLitNum:2
% 0.20/0.64 %MaxfuncDepth:0
% 0.20/0.64 %SharedTerms:2
% 0.20/0.64 %goalClause: 1
% 0.20/0.64 %singleGoalClaCount:1
% 0.20/0.64 [1]~P1(a1)
% 0.20/0.64 [2]P3(x21)+P2(x21)
% 0.20/0.64 [3]P1(x31)+P2(x31)
% 0.20/0.64 [4]P3(x41)+P4(x41)
% 0.20/0.64 [5]P1(x51)+P4(x51)
% 0.20/0.64 [6]~P4(x61)+~P2(x61)
% 0.20/0.64 [7]~P3(x71)+~P4(x71)
% 0.20/0.64 %EqnAxiom
% 0.20/0.64
% 0.20/0.64 %-------------------------------------------
% 0.20/0.64 cnf(12,plain,
% 0.20/0.64 ($false),
% 0.20/0.64 inference(scs_inference,[],[1,5,3,7,6]),
% 0.20/0.64 ['proof']).
% 0.20/0.64 % SZS output end Proof
% 0.20/0.64 % Total time :0.000000s
%------------------------------------------------------------------------------