TSTP Solution File: LCL076-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL076-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 : n010.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 : Thu Aug 31 06:47:52 EDT 2023
% Result : Unsatisfiable 204.82s 204.90s
% Output : CNFRefutation 204.93s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : LCL076-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.15 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.14/0.36 % Computer : n010.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 24 23:33:05 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.59 start to proof:theBenchmark
% 204.82/204.87 %-------------------------------------------
% 204.82/204.87 % File :CSE---1.6
% 204.82/204.87 % Problem :theBenchmark
% 204.82/204.87 % Transform :cnf
% 204.82/204.87 % Format :tptp:raw
% 204.82/204.87 % Command :java -jar mcs_scs.jar %d %s
% 204.82/204.87
% 204.82/204.87 % Result :Theorem 204.150000s
% 204.82/204.87 % Output :CNFRefutation 204.150000s
% 204.82/204.87 %-------------------------------------------
% 204.82/204.90 %--------------------------------------------------------------------------
% 204.82/204.90 % File : LCL076-1 : TPTP v8.1.2. Released v1.0.0.
% 204.82/204.90 % Domain : Logic Calculi (Implication/Negation 2 valued sentential)
% 204.82/204.90 % Problem : CN-40 depends on the Church system
% 204.82/204.90 % Version : [McC92] axioms.
% 204.82/204.90 % English : Axiomatisations of the Implication/Negation 2 valued
% 204.82/204.90 % sentential calculus are {CN-1,CN-2,CN-3} by Lukasiewicz,
% 204.82/204.90 % {CN-18,CN-21,CN-35,CN-39,CN-39,CN-40,CN-46} by Frege,
% 204.82/204.90 % {CN-3,CN-18,CN-21,CN-22,CN-30,CN-54} by Hilbert, {CN-18,
% 204.82/204.90 % CN-35,CN-49} by Church, {CN-19,CN-37,CN-59} by Lukasiewicz,
% 204.82/204.90 % {CN-19,CN-37,CN-60} by Wos, and the single Meredith axiom.
% 204.82/204.90 % Show that CN-40 depends on the Church system.
% 204.82/204.90
% 204.82/204.90 % Refs : [Mor84] Morgan (1984), Logic Problems
% 204.82/204.90 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au
% 204.82/204.90 % Source : [Pel86]
% 204.82/204.90 % Names : Pelletier 66 [Pel86]
% 204.82/204.90
% 204.82/204.90 % Status : Unsatisfiable
% 204.82/204.90 % Rating : 0.00 v6.1.0, 0.07 v6.0.0, 0.00 v5.5.0, 0.12 v5.4.0, 0.17 v5.3.0, 0.25 v5.2.0, 0.15 v5.1.0, 0.19 v5.0.0, 0.07 v4.1.0, 0.20 v4.0.1, 0.00 v2.7.0, 0.25 v2.6.0, 0.00 v2.1.0, 0.00 v2.0.0
% 204.82/204.90 % Syntax : Number of clauses : 5 ( 4 unt; 0 nHn; 2 RR)
% 204.82/204.90 % Number of literals : 7 ( 0 equ; 3 neg)
% 204.82/204.90 % Maximal clause size : 3 ( 1 avg)
% 204.82/204.90 % Maximal term depth : 4 ( 2 avg)
% 204.82/204.90 % Number of predicates : 1 ( 1 usr; 0 prp; 1-1 aty)
% 204.82/204.90 % Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% 204.82/204.90 % Number of variables : 9 ( 1 sgn)
% 204.82/204.90 % SPC : CNF_UNS_RFO_NEQ_HRN
% 204.82/204.90
% 204.82/204.90 % Comments :
% 204.82/204.90 %--------------------------------------------------------------------------
% 204.82/204.90 cnf(condensed_detachment,axiom,
% 204.82/204.90 ( ~ is_a_theorem(implies(X,Y))
% 204.82/204.90 | ~ is_a_theorem(X)
% 204.82/204.90 | is_a_theorem(Y) ) ).
% 204.82/204.90
% 204.82/204.90 cnf(cn_18,axiom,
% 204.82/204.90 is_a_theorem(implies(X,implies(Y,X))) ).
% 204.82/204.90
% 204.82/204.90 cnf(cn_35,axiom,
% 204.82/204.90 is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))) ).
% 204.82/204.90
% 204.82/204.90 cnf(cn_49,axiom,
% 204.82/204.90 is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))) ).
% 204.82/204.90
% 204.82/204.90 cnf(prove_cn_40,negated_conjecture,
% 204.82/204.90 ~ is_a_theorem(implies(a,not(not(a)))) ).
% 204.82/204.90
% 204.82/204.90 %--------------------------------------------------------------------------
% 204.82/204.90 %-------------------------------------------
% 204.82/204.90 % Proof found
% 204.82/204.90 % SZS status Theorem for theBenchmark
% 204.82/204.90 % SZS output start Proof
% 204.87/204.94 %ClaNum:5(EqnAxiom:0)
% 204.87/204.94 %VarNum:18(SingletonVarNum:9)
% 204.87/204.94 %MaxLitNum:3
% 204.87/204.94 %MaxfuncDepth:3
% 204.87/204.94 %SharedTerms:5
% 204.87/204.94 %goalClause: 4
% 204.87/204.94 %singleGoalClaCount:1
% 204.87/204.94 [4]~P1(f1(a2,f3(f3(a2))))
% 204.87/204.94 [1]P1(f1(x11,f1(x12,x11)))
% 204.87/204.94 [2]P1(f1(f1(f3(x21),f3(x22)),f1(x22,x21)))
% 204.87/204.94 [3]P1(f1(f1(x31,f1(x32,x33)),f1(f1(x31,x32),f1(x31,x33))))
% 204.87/204.94 [5]P1(x51)+~P1(x52)+~P1(f1(x52,x51))
% 204.87/204.94 %EqnAxiom
% 204.87/204.94
% 204.87/204.94 %-------------------------------------------
% 204.93/204.97 cnf(9,plain,
% 204.93/204.97 (P1(f1(f1(x91,x92),f1(x91,x91)))),
% 204.93/204.97 inference(scs_inference,[],[1,3,5])).
% 204.93/204.97 cnf(13,plain,
% 204.93/204.97 (P1(f1(x131,x131))),
% 204.93/204.97 inference(scs_inference,[],[1,9,5])).
% 204.93/204.97 cnf(18,plain,
% 204.93/204.97 (P1(f1(f1(f1(x181,x182),x181),f1(f1(x181,x182),x182)))),
% 204.93/204.97 inference(scs_inference,[],[13,3,5])).
% 204.93/204.97 cnf(24,plain,
% 204.93/204.97 (P1(f1(x241,f1(f1(f3(x242),f3(x243)),f1(x243,x242))))),
% 204.93/204.97 inference(scs_inference,[],[1,2,5])).
% 204.93/204.97 cnf(29,plain,
% 204.93/204.97 (P1(f1(x291,f1(f1(x292,x293),f1(x292,x292))))),
% 204.93/204.97 inference(scs_inference,[],[9,1,5])).
% 204.93/204.97 cnf(32,plain,
% 204.93/204.97 (P1(f1(f1(x321,f1(x322,x323)),f1(x321,f1(x322,x322))))),
% 204.93/204.97 inference(scs_inference,[],[29,3,5])).
% 204.93/204.97 cnf(54,plain,
% 204.93/204.97 (P1(f1(x541,f1(x542,x542)))),
% 204.93/204.97 inference(scs_inference,[],[32,1,5])).
% 204.93/204.97 cnf(60,plain,
% 204.93/204.97 (P1(f1(f1(f1(x601,x601),x602),x602))),
% 204.93/204.97 inference(scs_inference,[],[54,18,5])).
% 204.93/204.97 cnf(785,plain,
% 204.93/204.97 (P1(f1(x7851,f1(f1(f1(x7852,x7852),x7853),x7853)))),
% 204.93/204.97 inference(scs_inference,[],[1,60,5])).
% 204.93/204.97 cnf(812,plain,
% 204.93/204.97 (P1(f1(f1(x8121,f1(f1(x8122,x8122),x8123)),f1(x8121,x8123)))),
% 204.93/204.97 inference(scs_inference,[],[3,785,5])).
% 204.93/204.97 cnf(816,plain,
% 204.93/204.97 (P1(f1(f1(x8161,f1(x8161,x8162)),f1(x8161,x8162)))),
% 204.93/204.97 inference(scs_inference,[],[3,812,5])).
% 204.93/204.97 cnf(824,plain,
% 204.93/204.97 (P1(f1(f1(x8241,f1(f3(x8242),f3(x8243))),f1(x8241,f1(x8243,x8242))))),
% 204.93/204.97 inference(scs_inference,[],[3,24,5])).
% 204.93/204.97 cnf(2053,plain,
% 204.93/204.97 (P1(f1(f1(f3(x20531),f1(f3(x20531),f3(x20532))),f1(x20532,x20531)))),
% 204.93/204.97 inference(scs_inference,[],[824,816,5])).
% 204.93/204.97 cnf(2073,plain,
% 204.93/204.97 (P1(f1(f3(x20731),f1(x20731,x20732)))),
% 204.93/204.97 inference(scs_inference,[],[824,1,5])).
% 204.93/204.97 cnf(2077,plain,
% 204.93/204.97 (P1(f1(f3(f3(x20771)),f1(x20772,x20771)))),
% 204.93/204.97 inference(scs_inference,[],[824,2073,5])).
% 204.93/204.97 cnf(2089,plain,
% 204.93/204.97 ($false),
% 204.93/204.97 inference(scs_inference,[],[2053,2077,4,5]),
% 204.93/204.97 ['proof']).
% 204.93/204.98 % SZS output end Proof
% 204.93/204.98 % Total time :204.150000s
%------------------------------------------------------------------------------