TSTP Solution File: LCL076-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL076-2 : 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 : n012.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 0.20s 0.62s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.12 % Problem : LCL076-2 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.35 % Computer : n012.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 : Fri Aug 25 04:43:11 EDT 2023
% 0.13/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 : LCL076-2 : TPTP v8.1.2. Released v1.0.0.
% 0.20/0.61 % Domain : Logic Calculi (Implication/Negation 2 valued sentential)
% 0.20/0.61 % Problem : CN-40 depends on the Church system
% 0.20/0.61 % Version : [ANL] axioms : Augmented.
% 0.20/0.61 % English : Axiomatisations of the Implication/Negation 2 valued
% 0.20/0.61 % sentential calculus are {CN-1,CN-2,CN-3} by Lukasiewicz,
% 0.20/0.61 % {CN-18,CN-21,CN-35,CN-39,CN-39,CN-40,CN-46} by Frege,
% 0.20/0.61 % {CN-3,CN-18,CN-21,CN-22,CN-30,CN-54} by Hilbert, {CN-18,
% 0.20/0.61 % CN-35,CN-49} by Church, {CN-19,CN-37,CN-59} by Lukasiewicz,
% 0.20/0.61 % {CN-19,CN-37,CN-60} by Wos, and the single Meredith axiom.
% 0.20/0.61 % Show that CN-40 depends on the Church system.
% 0.20/0.61
% 0.20/0.61 % Refs :
% 0.20/0.61 % Source : [ANL]
% 0.20/0.61 % Names : morgan.three.ver1.in [ANL]
% 0.20/0.61 % : morgan.three.ver2.in [ANL]
% 0.20/0.61
% 0.20/0.61 % Status : Unsatisfiable
% 0.20/0.61 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v2.0.0
% 0.20/0.61 % Syntax : Number of clauses : 6 ( 5 unt; 0 nHn; 2 RR)
% 0.20/0.61 % Number of literals : 8 ( 0 equ; 3 neg)
% 0.20/0.61 % Maximal clause size : 3 ( 1 avg)
% 0.20/0.61 % Maximal term depth : 4 ( 2 avg)
% 0.20/0.61 % Number of predicates : 1 ( 1 usr; 0 prp; 1-1 aty)
% 0.20/0.61 % Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% 0.20/0.61 % Number of variables : 10 ( 1 sgn)
% 0.20/0.61 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.20/0.61
% 0.20/0.61 % Comments : Contributed to the ANL library by Charles Morgan.
% 0.20/0.61 %--------------------------------------------------------------------------
% 0.20/0.61 cnf(condensed_detachment,axiom,
% 0.20/0.61 ( ~ is_a_theorem(implies(X,Y))
% 0.20/0.61 | ~ is_a_theorem(X)
% 0.20/0.61 | is_a_theorem(Y) ) ).
% 0.20/0.61
% 0.20/0.61 cnf(cn_18,axiom,
% 0.20/0.61 is_a_theorem(implies(X,implies(Y,X))) ).
% 0.20/0.61
% 0.20/0.61 cnf(cn_35,axiom,
% 0.20/0.61 is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))) ).
% 0.20/0.61
% 0.20/0.61 cnf(cn_49,axiom,
% 0.20/0.61 is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))) ).
% 0.20/0.61
% 0.20/0.62 cnf(extra_lemma,axiom,
% 0.20/0.62 is_a_theorem(implies(not(not(X1)),X1)) ).
% 0.20/0.62
% 0.20/0.62 cnf(prove_cn_40,negated_conjecture,
% 0.20/0.62 ~ is_a_theorem(implies(a,not(not(a)))) ).
% 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:6(EqnAxiom:0)
% 0.20/0.62 %VarNum:20(SingletonVarNum:10)
% 0.20/0.62 %MaxLitNum:3
% 0.20/0.62 %MaxfuncDepth:3
% 0.20/0.62 %SharedTerms:5
% 0.20/0.62 %goalClause: 5
% 0.20/0.62 %singleGoalClaCount:1
% 0.20/0.62 [5]~P1(f2(a3,f1(f1(a3))))
% 0.20/0.62 [1]P1(f2(f1(f1(x11)),x11))
% 0.20/0.62 [2]P1(f2(x21,f2(x22,x21)))
% 0.20/0.62 [3]P1(f2(f2(f1(x31),f1(x32)),f2(x32,x31)))
% 0.20/0.62 [4]P1(f2(f2(x41,f2(x42,x43)),f2(f2(x41,x42),f2(x41,x43))))
% 0.20/0.62 [6]P1(x61)+~P1(x62)+~P1(f2(x62,x61))
% 0.20/0.62 %EqnAxiom
% 0.20/0.62
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 cnf(9,plain,
% 0.20/0.62 ($false),
% 0.20/0.62 inference(scs_inference,[],[5,1,3,6]),
% 0.20/0.62 ['proof']).
% 0.20/0.62 % SZS output end Proof
% 0.20/0.62 % Total time :0.000000s
%------------------------------------------------------------------------------