↑ Up

Twee---2.7.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Twee---2.7
% Problem  : PLA020-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 12:27:34 PM UTC 2026

% Result   : Unsatisfiable 0.24s 0.56s
% Output   : Proof 0.24s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PLA020-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38  % Computer : n016.cluster.edu
% 0.13/0.38  % Model    : x86_64 x86_64
% 0.13/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38  % Memory   : 8046.5625MB
% 0.13/0.38  % OS       : Linux 6.8.0-71-generic
% 0.13/0.38  % CPULimit : 300
% 0.13/0.38  % WCLimit  : 300
% 0.13/0.38  % DateTime : Sun Sep 27 22:15:17 UTC 2026
% 0.13/0.38  % CPUTime  : 
% 0.13/0.38  Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.24/0.56  Command-line arguments: --lhs-weight 9 --flip-ordering --complete-subsets --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 0.24/0.56  
% 0.24/0.56  % SZS status Unsatisfiable
% 0.24/0.56  
% 0.24/0.56  % SZS output start Proof
% 0.24/0.56  Axiom 1 (initial_state8): holds(empty, s0) = true.
% 0.24/0.56  Axiom 2 (initial_state7): holds(clear(c), s0) = true.
% 0.24/0.56  Axiom 3 (initial_state3): holds(on(c, d), s0) = true.
% 0.24/0.56  Axiom 4 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 0.24/0.56  Axiom 5 (pickup_2): ifeq(holds(on(X, Y), Z), true, ifeq(holds(clear(X), Z), true, ifeq(holds(empty, Z), true, holds(clear(Y), do(pickup(X), Z)), true), true), true) = true.
% 0.24/0.56  
% 0.24/0.56  Goal 1 (prove_D): holds(clear(d), X) = true.
% 0.24/0.56  The goal is true when:
% 0.24/0.56    X = do(pickup(c), s0)
% 0.24/0.56  
% 0.24/0.56  Proof:
% 0.24/0.56    holds(clear(d), do(pickup(c), s0))
% 0.24/0.56  = { by axiom 4 (ifeq_axiom) R->L }
% 0.24/0.56    ifeq(true, true, holds(clear(d), do(pickup(c), s0)), true)
% 0.24/0.56  = { by axiom 1 (initial_state8) R->L }
% 0.24/0.56    ifeq(holds(empty, s0), true, holds(clear(d), do(pickup(c), s0)), true)
% 0.24/0.56  = { by axiom 4 (ifeq_axiom) R->L }
% 0.24/0.56    ifeq(true, true, ifeq(holds(empty, s0), true, holds(clear(d), do(pickup(c), s0)), true), true)
% 0.24/0.56  = { by axiom 2 (initial_state7) R->L }
% 0.24/0.56    ifeq(holds(clear(c), s0), true, ifeq(holds(empty, s0), true, holds(clear(d), do(pickup(c), s0)), true), true)
% 0.24/0.56  = { by axiom 4 (ifeq_axiom) R->L }
% 0.24/0.56    ifeq(true, true, ifeq(holds(clear(c), s0), true, ifeq(holds(empty, s0), true, holds(clear(d), do(pickup(c), s0)), true), true), true)
% 0.24/0.56  = { by axiom 3 (initial_state3) R->L }
% 0.24/0.56    ifeq(holds(on(c, d), s0), true, ifeq(holds(clear(c), s0), true, ifeq(holds(empty, s0), true, holds(clear(d), do(pickup(c), s0)), true), true), true)
% 0.24/0.56  = { by axiom 5 (pickup_2) }
% 0.24/0.56    true
% 0.24/0.56  % SZS output end Proof
% 0.24/0.56  
% 0.24/0.56  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------