TSTP Solution File: LCL156-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL156-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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 : 600s
% DateTime : Sun Jul 17 13:44:25 EDT 2022
% Result : Unsatisfiable 0.74s 1.06s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL156-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n020.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 : 600
% 0.13/0.35 % DateTime : Sun Jul 3 11:34:00 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.74/1.06 ============================== Prover9 ===============================
% 0.74/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.06 Process 30214 was started by sandbox on n020.cluster.edu,
% 0.74/1.06 Sun Jul 3 11:34:00 2022
% 0.74/1.06 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_30060_n020.cluster.edu".
% 0.74/1.06 ============================== end of head ===========================
% 0.74/1.06
% 0.74/1.06 ============================== INPUT =================================
% 0.74/1.06
% 0.74/1.06 % Reading from file /tmp/Prover9_30060_n020.cluster.edu
% 0.74/1.06
% 0.74/1.06 set(prolog_style_variables).
% 0.74/1.06 set(auto2).
% 0.74/1.06 % set(auto2) -> set(auto).
% 0.74/1.06 % set(auto) -> set(auto_inference).
% 0.74/1.06 % set(auto) -> set(auto_setup).
% 0.74/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.06 % set(auto) -> set(auto_limits).
% 0.74/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.06 % set(auto) -> set(auto_denials).
% 0.74/1.06 % set(auto) -> set(auto_process).
% 0.74/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.06 % set(auto2) -> assign(stats, some).
% 0.74/1.06 % set(auto2) -> clear(echo_input).
% 0.74/1.06 % set(auto2) -> set(quiet).
% 0.74/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.06 % set(auto2) -> clear(print_given).
% 0.74/1.06 assign(lrs_ticks,-1).
% 0.74/1.06 assign(sos_limit,10000).
% 0.74/1.06 assign(order,kbo).
% 0.74/1.06 set(lex_order_vars).
% 0.74/1.06 clear(print_given).
% 0.74/1.06
% 0.74/1.06 % formulas(sos). % not echoed (17 formulas)
% 0.74/1.06
% 0.74/1.06 ============================== end of input ==========================
% 0.74/1.06
% 0.74/1.06 % From the command line: assign(max_seconds, 300).
% 0.74/1.06
% 0.74/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.06
% 0.74/1.06 % Formulas that are not ordinary clauses:
% 0.74/1.06
% 0.74/1.06 ============================== end of process non-clausal formulas ===
% 0.74/1.06
% 0.74/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.06
% 0.74/1.06 ============================== PREDICATE ELIMINATION =================
% 0.74/1.06
% 0.74/1.06 ============================== end predicate elimination =============
% 0.74/1.06
% 0.74/1.06 Auto_denials:
% 0.74/1.06 % copying label prove_alternative_wajsberg_axiom to answer in negative clause
% 0.74/1.06
% 0.74/1.06 Term ordering decisions:
% 0.74/1.06
% 0.74/1.06 % Assigning unary symbol not kb_weight 0 and highest precedence (10).
% 0.74/1.06 Function symbol KB weights: truth=1. falsehood=1. x=1. implies=1. or=1. and=1. and_star=1. xor=1. not=0.
% 0.74/1.06
% 0.74/1.06 ============================== end of process initial clauses ========
% 0.74/1.06
% 0.74/1.06 ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.06
% 0.74/1.06 ============================== end of clauses for search =============
% 0.74/1.06
% 0.74/1.06 ============================== SEARCH ================================
% 0.74/1.06
% 0.74/1.06 % Starting search at 0.01 seconds.
% 0.74/1.06
% 0.74/1.06 ============================== PROOF =================================
% 0.74/1.06 % SZS status Unsatisfiable
% 0.74/1.06 % SZS output start Refutation
% 0.74/1.06
% 0.74/1.06 % Proof 1 at 0.03 (+ 0.00) seconds: prove_alternative_wajsberg_axiom.
% 0.74/1.06 % Length of proof is 28.
% 0.74/1.06 % Level of proof is 9.
% 0.74/1.06 % Maximum clause weight is 19.000.
% 0.74/1.06 % Given clauses 27.
% 0.74/1.06
% 0.74/1.06 1 not(truth) = falsehood # label(false_definition) # label(axiom). [assumption].
% 0.74/1.06 2 implies(truth,A) = A # label(wajsberg_1) # label(axiom). [assumption].
% 0.74/1.06 3 or(A,B) = or(B,A) # label(or_commutativity) # label(axiom). [assumption].
% 0.74/1.06 6 and_star(A,B) = and_star(B,A) # label(and_star_commutativity) # label(axiom). [assumption].
% 0.74/1.06 7 or(A,B) = implies(not(A),B) # label(or_definition) # label(axiom). [assumption].
% 0.74/1.06 10 and_star(A,B) = not(or(not(A),not(B))) # label(and_star_definition) # label(axiom). [assumption].
% 0.74/1.06 11 and_star(A,B) = not(implies(not(not(A)),not(B))). [copy(10),rewrite([7(4)])].
% 0.74/1.06 12 implies(implies(A,B),B) = implies(implies(B,A),A) # label(wajsberg_3) # label(axiom). [assumption].
% 0.74/1.06 13 implies(implies(not(A),not(B)),implies(B,A)) = truth # label(wajsberg_4) # label(axiom). [assumption].
% 0.74/1.06 19 implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth # label(wajsberg_2) # label(axiom). [assumption].
% 0.74/1.06 22 and_star(x,truth) != x # label(prove_alternative_wajsberg_axiom) # label(negated_conjecture) # answer(prove_alternative_wajsberg_axiom). [assumption].
% 0.74/1.06 23 not(implies(not(falsehood),not(x))) != x # answer(prove_alternative_wajsberg_axiom). [copy(22),rewrite([6(3),11(3),1(2)])].
% 0.74/1.06 24 implies(not(A),B) = implies(not(B),A). [back_rewrite(3),rewrite([7(1),7(3)])].
% 0.74/1.06 25 implies(implies(A,truth),truth) = implies(A,A). [para(2(a,1),12(a,1,1)),flip(a)].
% 0.74/1.06 28 implies(implies(not(A),falsehood),A) = truth. [para(1(a,1),13(a,1,1,2)),rewrite([2(5)])].
% 0.74/1.06 29 implies(implies(implies(A,B),implies(not(B),not(A))),implies(not(B),not(A))) = implies(A,B). [para(13(a,1),12(a,1,1)),rewrite([2(3)]),flip(a)].
% 0.74/1.06 73 implies(A,implies(implies(A,B),B)) = truth. [para(2(a,1),19(a,1,1)),rewrite([2(3)])].
% 0.74/1.06 101 implies(not(A),truth) = implies(falsehood,A). [para(1(a,1),24(a,1,1)),flip(a)].
% 0.74/1.06 131 implies(implies(falsehood,not(falsehood)),not(falsehood)) = truth. [para(28(a,1),12(a,1)),flip(a)].
% 0.74/1.06 193 implies(A,A) = truth. [para(73(a,1),2(a,1)),rewrite([2(3)]),flip(a)].
% 0.74/1.06 205 implies(A,truth) = truth. [para(25(a,1),73(a,1,2)),rewrite([193(1)])].
% 0.74/1.06 206 implies(falsehood,A) = truth. [para(101(a,2),73(a,1,2,1)),rewrite([205(4),2(3)])].
% 0.74/1.06 223 not(falsehood) = truth. [back_rewrite(131),rewrite([206(4),2(4)])].
% 0.74/1.06 231 not(not(x)) != x # answer(prove_alternative_wajsberg_axiom). [back_rewrite(23),rewrite([223(2),2(4)])].
% 0.74/1.06 236 implies(not(A),falsehood) = A. [para(223(a,1),24(a,1,1)),rewrite([2(2)]),flip(a)].
% 0.74/1.06 258 implies(A,falsehood) = not(A). [para(236(a,1),12(a,1,1)),rewrite([206(5),2(5)])].
% 0.74/1.06 264 not(not(A)) = A. [para(236(a,1),29(a,2)),rewrite([258(3),223(4),2(6),193(5),223(3),2(5),2(4)])].
% 0.74/1.06 265 $F # answer(prove_alternative_wajsberg_axiom). [resolve(264,a,231,a)].
% 0.74/1.06
% 0.74/1.06 % SZS output end Refutation
% 0.74/1.06 ============================== end of proof ==========================
% 0.74/1.06
% 0.74/1.06 ============================== STATISTICS ============================
% 0.74/1.06
% 0.74/1.06 Given=27. Generated=695. Kept=257. proofs=1.
% 0.74/1.06 Usable=21. Sos=121. Demods=95. Limbo=6, Disabled=125. Hints=0.
% 0.74/1.06 Megabytes=0.33.
% 0.74/1.06 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.74/1.06
% 0.74/1.06 ============================== end of statistics =====================
% 0.74/1.06
% 0.74/1.06 ============================== end of search =========================
% 0.74/1.06
% 0.74/1.06 THEOREM PROVED
% 0.74/1.06 % SZS status Unsatisfiable
% 0.74/1.06
% 0.74/1.06 Exiting with 1 proof.
% 0.74/1.06
% 0.74/1.06 Process 30214 exit (max_proofs) Sun Jul 3 11:34:00 2022
% 0.74/1.06 Prover9 interrupted
%------------------------------------------------------------------------------