TSTP Solution File: SYN331-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SYN331-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 : n019.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:13 EDT 2023
% Result : Unsatisfiable 120.48s 121.53s
% Output : CNFRefutation 120.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN331-1 : TPTP v8.1.2. Released v1.2.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.14/0.35 % Computer : n019.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 19:31:28 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.57 start to proof:theBenchmark
% 120.48/121.50 %-------------------------------------------
% 120.48/121.50 % File :CSE---1.6
% 120.48/121.50 % Problem :theBenchmark
% 120.48/121.50 % Transform :cnf
% 120.48/121.50 % Format :tptp:raw
% 120.48/121.50 % Command :java -jar mcs_scs.jar %d %s
% 120.48/121.50
% 120.48/121.50 % Result :Theorem 120.000000s
% 120.48/121.50 % Output :CNFRefutation 120.000000s
% 120.48/121.50 %-------------------------------------------
% 120.48/121.53 %--------------------------------------------------------------------------
% 120.48/121.53 % File : SYN331-1 : TPTP v8.1.2. Released v1.2.0.
% 120.48/121.53 % Domain : Syntactic
% 120.48/121.53 % Problem : Church problem 46.14 (3)
% 120.48/121.53 % Version : Especial.
% 120.48/121.53 % English :
% 120.48/121.53
% 120.48/121.53 % Refs : [Chu56] Church (1956), Introduction to Mathematical Logic I
% 120.48/121.53 % : [FL+93] Fermuller et al. (1993), Resolution Methods for the De
% 120.48/121.53 % : [Tam94] Tammet (1994), Email to Geoff Sutcliffe.
% 120.48/121.53 % Source : [Tam94]
% 120.48/121.53 % Names : Ch14N3 [Tam94]
% 120.48/121.53
% 120.48/121.53 % Status : Unsatisfiable
% 120.48/121.53 % Rating : 0.00 v2.0.0
% 120.48/121.53 % Syntax : Number of clauses : 7 ( 4 unt; 1 nHn; 4 RR)
% 120.48/121.53 % Number of literals : 10 ( 0 equ; 4 neg)
% 120.48/121.53 % Maximal clause size : 2 ( 1 avg)
% 120.48/121.53 % Maximal term depth : 2 ( 1 avg)
% 120.48/121.53 % Number of predicates : 1 ( 1 usr; 0 prp; 2-2 aty)
% 120.48/121.53 % Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% 120.48/121.53 % Number of variables : 14 ( 4 sgn)
% 120.48/121.53 % SPC : CNF_UNS_RFO_NEQ_NHN
% 120.48/121.53
% 120.48/121.53 % Comments : All the problems here can be decided by using a certain
% 120.48/121.53 % completeness-preserving term ordering strategies. See [FL+93].
% 120.48/121.53 % : The conversion from the full 1st order form in [Chu56]
% 120.48/121.53 % to clause form was done by hand by Tanel Tammet.
% 120.48/121.53 %--------------------------------------------------------------------------
% 120.48/121.53 cnf(clause1,negated_conjecture,
% 120.48/121.53 f(X,z(X,Y)) ).
% 120.48/121.53
% 120.48/121.53 cnf(clause2,negated_conjecture,
% 120.48/121.53 f(Y,z(X,Y)) ).
% 120.48/121.53
% 120.48/121.53 cnf(clause3,negated_conjecture,
% 120.48/121.53 ( f(X,Y)
% 120.48/121.53 | ~ f(z(X,Y),z(X,Y)) ) ).
% 120.48/121.53
% 120.48/121.53 cnf(clause4,negated_conjecture,
% 120.48/121.53 ( ~ f(X,Y)
% 120.48/121.53 | f(z(X,Y),z(X,Y)) ) ).
% 120.48/121.53
% 120.48/121.53 cnf(clause5,negated_conjecture,
% 120.48/121.53 ( f(Y,X)
% 120.48/121.53 | f(z(X,Y),z(X,Y)) ) ).
% 120.48/121.53
% 120.48/121.53 cnf(clause6,negated_conjecture,
% 120.48/121.53 ~ f(z(X,Y),X) ).
% 120.48/121.53
% 120.48/121.53 cnf(clause7,negated_conjecture,
% 120.48/121.53 ~ f(z(X,Y),Y) ).
% 120.48/121.53
% 120.48/121.53 %--------------------------------------------------------------------------
% 120.48/121.53 %-------------------------------------------
% 120.48/121.53 % Proof found
% 120.48/121.53 % SZS status Theorem for theBenchmark
% 120.48/121.53 % SZS output start Proof
% 120.48/121.56 %ClaNum:7(EqnAxiom:0)
% 120.48/121.56 %VarNum:30(SingletonVarNum:14)
% 120.48/121.56 %MaxLitNum:2
% 120.48/121.56 %MaxfuncDepth:1
% 120.48/121.56 %SharedTerms:0
% 120.48/121.56 %goalClause: 1 2 3 4 5 6 7
% 120.48/121.56 %singleGoalClaCount:4
% 120.48/121.56 [1]P1(x11,f1(x12,x11))
% 120.48/121.56 [2]P1(x21,f1(x21,x22))
% 120.48/121.56 [3]~P1(f1(x31,x32),x32)
% 120.48/121.56 [4]~P1(f1(x41,x42),x41)
% 120.48/121.56 [5]P1(x51,x52)+P1(f1(x52,x51),f1(x52,x51))
% 120.48/121.56 [6]~P1(x61,x62)+P1(f1(x61,x62),f1(x61,x62))
% 120.48/121.56 [7]P1(x71,x72)+~P1(f1(x71,x72),f1(x71,x72))
% 120.48/121.56 %EqnAxiom
% 120.48/121.56
% 120.48/121.56 %-------------------------------------------
% 120.48/121.59 cnf(8,plain,
% 120.48/121.59 (P1(f1(f1(f1(x81,x82),x82),f1(f1(x81,x82),x82)),f1(f1(f1(x81,x82),x82),f1(f1(x81,x82),x82)))),
% 120.48/121.59 inference(scs_inference,[],[3,5,7])).
% 120.48/121.59 cnf(13,plain,
% 120.48/121.59 (P1(f1(f1(x131,x132),x132),f1(f1(x131,x132),x132))),
% 120.48/121.59 inference(scs_inference,[],[8,7])).
% 120.48/121.59 cnf(15,plain,
% 120.48/121.59 ($false),
% 120.48/121.59 inference(scs_inference,[],[13,3,7]),
% 120.48/121.59 ['proof']).
% 120.48/121.59 % SZS output end Proof
% 120.48/121.59 % Total time :120.000000s
%------------------------------------------------------------------------------