TSTP Solution File: SYN326-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SYN326-1 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n011.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:45:12 EDT 2023
% Result : Unsatisfiable 0.20s 0.62s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN326-1 : TPTP v8.1.2. Released v1.2.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 20:48:39 EDT 2023
% 0.20/0.35 % CPUTime :
% 0.20/0.56 start to proof:theBenchmark
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 % File :CSE---1.6
% 0.20/0.61 % Problem :theBenchmark
% 0.20/0.61 % Transform :cnf
% 0.20/0.61 % Format :tptp:raw
% 0.20/0.61 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.61
% 0.20/0.61 % Result :Theorem 0.000000s
% 0.20/0.61 % Output :CNFRefutation 0.000000s
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 %--------------------------------------------------------------------------
% 0.20/0.61 % File : SYN326-1 : TPTP v8.1.2. Released v1.2.0.
% 0.20/0.61 % Domain : Syntactic
% 0.20/0.61 % Problem : Church problem 46.12 (1)
% 0.20/0.61 % Version : Especial.
% 0.20/0.61 % English :
% 0.20/0.61
% 0.20/0.61 % Refs : [Chu56] Church (1956), Introduction to Mathematical Logic I
% 0.20/0.61 % : [FL+93] Fermuller et al. (1993), Resolution Methods for the De
% 0.20/0.61 % : [Tam94] Tammet (1994), Email to Geoff Sutcliffe.
% 0.20/0.61 % Source : [Tam94]
% 0.20/0.61 % Names : Ch12N1 [Tam94]
% 0.20/0.61
% 0.20/0.62 % Status : Unsatisfiable
% 0.20/0.62 % Rating : 0.00 v2.0.0
% 0.20/0.62 % Syntax : Number of clauses : 7 ( 2 unt; 3 nHn; 3 RR)
% 0.20/0.62 % Number of literals : 12 ( 0 equ; 3 neg)
% 0.20/0.62 % Maximal clause size : 2 ( 1 avg)
% 0.20/0.62 % Maximal term depth : 2 ( 1 avg)
% 0.20/0.62 % Number of predicates : 3 ( 3 usr; 0 prp; 1-2 aty)
% 0.20/0.62 % Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% 0.20/0.62 % Number of variables : 7 ( 0 sgn)
% 0.20/0.62 % SPC : CNF_UNS_RFO_NEQ_NHN
% 0.20/0.62
% 0.20/0.62 % Comments : All the problems here can be decided by using a certain
% 0.20/0.62 % completeness-preserving term ordering strategies. See [FL+93].
% 0.20/0.62 % : The conversion from the full 1st order form in [Chu56]
% 0.20/0.62 % to clause form was done by hand by Tanel Tammet.
% 0.20/0.62 %--------------------------------------------------------------------------
% 0.20/0.62 cnf(clause1,negated_conjecture,
% 0.20/0.62 ( f(y(X),z(X))
% 0.20/0.62 | f(X,X) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(clause2,negated_conjecture,
% 0.20/0.62 ( g(y(X))
% 0.20/0.62 | f(X,X) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(clause3,negated_conjecture,
% 0.20/0.62 ( ~ h(X)
% 0.20/0.62 | f(X,X) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(clause4,negated_conjecture,
% 0.20/0.62 ( f(z(X),X)
% 0.20/0.62 | h(z(X)) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(clause5,negated_conjecture,
% 0.20/0.62 ( ~ g(X)
% 0.20/0.62 | h(z(X)) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(clause6,negated_conjecture,
% 0.20/0.62 f(X,y(X)) ).
% 0.20/0.62
% 0.20/0.62 cnf(clause7,negated_conjecture,
% 0.20/0.62 ~ f(z(X),z(X)) ).
% 0.20/0.62
% 0.20/0.62 %--------------------------------------------------------------------------
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 % Proof found
% 0.20/0.62 % SZS status Theorem for theBenchmark
% 0.20/0.62 % SZS output start Proof
% 0.20/0.62 %ClaNum:7(EqnAxiom:0)
% 0.20/0.62 %VarNum:19(SingletonVarNum:7)
% 0.20/0.62 %MaxLitNum:2
% 0.20/0.62 %MaxfuncDepth:1
% 0.20/0.62 %SharedTerms:0
% 0.20/0.62 %goalClause: 1 2 3 4 5 6 7
% 0.20/0.62 %singleGoalClaCount:2
% 0.20/0.62 [1]P1(x11,f1(x11))
% 0.20/0.62 [2]~P1(f2(x21),f2(x21))
% 0.20/0.62 [4]~P2(x41)+P1(x41,x41)
% 0.20/0.62 [3]~P3(x31)+P2(f2(x31))
% 0.20/0.62 [5]P1(x51,x51)+P3(f1(x51))
% 0.20/0.62 [6]P1(f2(x61),x61)+P2(f2(x61))
% 0.20/0.62 [7]P1(x71,x71)+P1(f1(x71),f2(x71))
% 0.20/0.62 %EqnAxiom
% 0.20/0.62
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 cnf(9,plain,
% 0.20/0.62 (~P3(x91)),
% 0.20/0.62 inference(scs_inference,[],[2,4,3])).
% 0.20/0.62 cnf(10,plain,
% 0.20/0.62 (P3(f1(f2(x101)))),
% 0.20/0.62 inference(scs_inference,[],[2,4,3,5])).
% 0.20/0.62 cnf(12,plain,
% 0.20/0.62 ($false),
% 0.20/0.62 inference(scs_inference,[],[9,10]),
% 0.20/0.62 ['proof']).
% 0.20/0.62 % SZS output end Proof
% 0.20/0.62 % Total time :0.000000s
%------------------------------------------------------------------------------