TSTP Solution File: PLA024+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : PLA024+1 : TPTP v8.1.0. Bugfixed v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 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 : 600s
% DateTime : Mon Jul 18 16:56:42 EDT 2022
% Result : CounterSatisfiable 85.97s 11.20s
% Output : CNFRefutation 85.97s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PLA024+1 : TPTP v8.1.0. Bugfixed v2.5.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue May 31 23:09:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.38 # No SInE strategy applied
% 0.12/0.38 # Auto-Mode selected heuristic G_E___208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.38 #
% 0.12/0.38 # Presaturation interreduction done
% 0.12/0.38 # Number of axioms: 55 Number of unprocessed: 55
% 0.12/0.38 # Tableaux proof search.
% 0.12/0.38 # APR header successfully linked.
% 0.12/0.38 # Hello from C++
% 0.12/0.38 # The folding up rule is enabled...
% 0.12/0.38 # Local unification is enabled...
% 0.12/0.38 # Any saturation attempts will use folding labels...
% 0.12/0.38 # 55 beginning clauses after preprocessing and clausification
% 0.12/0.38 # Creating start rules for all 2 conjectures.
% 0.12/0.38 # There are 2 start rule candidates:
% 0.12/0.38 # Found 25 unit axioms.
% 0.12/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.38 # 2 start rule tableaux created.
% 0.12/0.38 # 30 extension rule candidate clauses
% 0.12/0.38 # 25 unit axiom clauses
% 0.12/0.38
% 0.12/0.38 # Requested 8, 32 cores available to the main process.
% 0.12/0.38 # There are not enough tableaux to fork, creating more from the initial 2
% 0.12/0.38 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.38 # We now have 10 tableaux to operate on
% 29.39/4.11 # Ran out of tableaux, making start rules for all clauses
% 29.74/4.15 # Ran out of tableaux, making start rules for all clauses
% 29.74/4.15 # Ran out of tableaux, making start rules for all clauses
% 29.74/4.16 # Ran out of tableaux, making start rules for all clauses
% 29.74/4.19 # Ran out of tableaux, making start rules for all clauses
% 29.74/4.19 # Ran out of tableaux, making start rules for all clauses
% 31.68/4.39 # Ran out of tableaux, making start rules for all clauses
% 59.81/7.94 # Ran out of tableaux, making start rules for all clauses
% 85.97/11.20 # 7471 Satisfiable branch
% 85.97/11.20 # Satisfiable branch found.
% 85.97/11.20 # There were 6 total branch saturation attempts.
% 85.97/11.20 # There were 0 of these attempts blocked.
% 85.97/11.20 # There were 0 deferred branch saturation attempts.
% 85.97/11.20 # There were 0 free duplicated saturations.
% 85.97/11.20 # There were 0 total successful branch saturations.
% 85.97/11.20 # There were 0 successful branch saturations in interreduction.
% 85.97/11.20 # There were 0 successful branch saturations on the branch.
% 85.97/11.20 # There were 0 successful branch saturations after the branch.
% 85.97/11.20 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 85.97/11.20 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 85.97/11.20 # Begin clausification derivation
% 85.97/11.20
% 85.97/11.20 # End clausification derivation
% 85.97/11.20 # Begin listing active clauses obtained from FOF to CNF conversion
% 85.97/11.20 cnf(i_0_55, negated_conjecture, (goal_time(esk1_0))).
% 85.97/11.20 cnf(i_0_38, hypothesis, (nonfixed(block_1))).
% 85.97/11.20 cnf(i_0_39, hypothesis, (nonfixed(block_2))).
% 85.97/11.20 cnf(i_0_40, hypothesis, (nonfixed(block_3))).
% 85.97/11.20 cnf(i_0_33, hypothesis, (a_block(block_1))).
% 85.97/11.20 cnf(i_0_34, hypothesis, (a_block(block_2))).
% 85.97/11.20 cnf(i_0_35, hypothesis, (a_block(block_3))).
% 85.97/11.20 cnf(i_0_36, hypothesis, (a_block(table))).
% 85.97/11.20 cnf(i_0_41, hypothesis, (time(time_0))).
% 85.97/11.20 cnf(i_0_37, hypothesis, (fixed(table))).
% 85.97/11.20 cnf(i_0_49, hypothesis, (clear(block_1,time_0))).
% 85.97/11.20 cnf(i_0_52, hypothesis, (clear(block_3,time_0))).
% 85.97/11.20 cnf(i_0_27, hypothesis, (different(block_1,block_2))).
% 85.97/11.20 cnf(i_0_28, hypothesis, (different(block_1,block_3))).
% 85.97/11.20 cnf(i_0_30, hypothesis, (different(block_1,table))).
% 85.97/11.20 cnf(i_0_42, hypothesis, (time(s(time_0)))).
% 85.97/11.20 cnf(i_0_29, hypothesis, (different(block_2,block_3))).
% 85.97/11.20 cnf(i_0_31, hypothesis, (different(block_2,table))).
% 85.97/11.20 cnf(i_0_32, hypothesis, (different(block_3,table))).
% 85.97/11.20 cnf(i_0_48, hypothesis, (on(block_1,block_2,time_0))).
% 85.97/11.20 cnf(i_0_50, hypothesis, (on(block_2,table,time_0))).
% 85.97/11.20 cnf(i_0_51, hypothesis, (on(block_3,table,time_0))).
% 85.97/11.20 cnf(i_0_43, hypothesis, (time(s(s(time_0))))).
% 85.97/11.20 cnf(i_0_53, hypothesis, (goal_time(s(s(s(time_0)))))).
% 85.97/11.20 cnf(i_0_44, hypothesis, (time(s(s(s(time_0)))))).
% 85.97/11.20 cnf(i_0_54, negated_conjecture, (~clear(block_2,esk1_0)|~on(block_1,table,esk1_0)|~on(block_2,block_3,esk1_0)|~on(block_3,block_1,esk1_0))).
% 85.97/11.20 cnf(i_0_20, plain, (~on(X1,X1,X2)|~a_block(X1))).
% 85.97/11.20 cnf(i_0_17, plain, (~destination(X1,X2)|~object(X1,X2)|~nonfixed(X1))).
% 85.97/11.20 cnf(i_0_16, plain, (~source(X1,X2)|~object(X1,X2)|~nonfixed(X1))).
% 85.97/11.20 cnf(i_0_18, plain, (~source(X1,X2)|~destination(X1,X2)|~a_block(X1))).
% 85.97/11.20 cnf(i_0_24, plain, (~fixed(X1)|~on(X1,X2,X3)|~a_block(X2))).
% 85.97/11.20 cnf(i_0_25, hypothesis, (neq(X1,X2)|~different(X2,X1))).
% 85.97/11.20 cnf(i_0_26, hypothesis, (neq(X1,X2)|~different(X1,X2))).
% 85.97/11.20 cnf(i_0_4, plain, (~clear(X1,s(X2))|~destination(X1,X2)|~time(X2)|~nonfixed(X1))).
% 85.97/11.20 cnf(i_0_6, plain, (clear(X1,X2)|~object(X1,X2)|~nonfixed(X1))).
% 85.97/11.20 cnf(i_0_7, plain, (clear(X1,X2)|~destination(X1,X2)|~nonfixed(X1))).
% 85.97/11.20 cnf(i_0_23, plain, (~clear(X1,X2)|~on(X3,X1,X2)|~nonfixed(X1)|~nonfixed(X3))).
% 85.97/11.20 cnf(i_0_47, hypothesis, (object(block_3,X1)|object(block_2,X1)|object(block_1,X1)|~time(X1))).
% 85.97/11.20 cnf(i_0_3, plain, (clear(X1,s(X2))|~source(X1,X2)|~time(X2)|~nonfixed(X1))).
% 85.97/11.20 cnf(i_0_46, hypothesis, (destination(table,X1)|destination(block_3,X1)|destination(block_2,X1)|destination(block_1,X1)|~time(X1))).
% 85.97/11.20 cnf(i_0_13, plain, (~object(X1,X2)|~object(X3,X2)|~neq(X3,X1)|~a_block(X1)|~nonfixed(X3))).
% 85.97/11.20 cnf(i_0_15, plain, (~destination(X1,X2)|~destination(X3,X2)|~neq(X3,X1)|~a_block(X1)|~a_block(X3))).
% 85.97/11.20 cnf(i_0_14, plain, (~source(X1,X2)|~source(X3,X2)|~neq(X3,X1)|~a_block(X1)|~a_block(X3))).
% 85.97/11.20 cnf(i_0_19, plain, (~on(X1,X2,X3)|~on(X2,X1,X3)|~neq(X2,X1)|~a_block(X1)|~a_block(X2))).
% 85.97/11.20 cnf(i_0_45, hypothesis, (source(table,X1)|source(block_3,X1)|source(block_2,X1)|source(block_1,X1)|~time(X1))).
% 85.97/11.20 cnf(i_0_10, plain, (clear(X1,X2)|source(X1,X2)|~clear(X1,s(X2))|~time(X2)|~nonfixed(X1))).
% 85.97/11.20 cnf(i_0_8, plain, (clear(X1,s(X2))|destination(X1,X2)|~clear(X1,X2)|~time(X2)|~nonfixed(X1))).
% 85.97/11.20 cnf(i_0_5, plain, (on(X1,X2,X3)|~source(X2,X3)|~object(X1,X3)|~neq(X1,X2)|~a_block(X2)|~nonfixed(X1))).
% 85.97/11.20 cnf(i_0_2, plain, (~source(X1,X2)|~on(X3,X1,s(X2))|~object(X3,X2)|~time(X2)|~neq(X3,X1)|~a_block(X1)|~nonfixed(X3))).
% 85.97/11.20 cnf(i_0_1, plain, (on(X1,X2,s(X3))|~destination(X2,X3)|~object(X1,X3)|~time(X3)|~neq(X1,X2)|~a_block(X2)|~nonfixed(X1))).
% 85.97/11.20 cnf(i_0_9, plain, (on(X1,X2,s(X3))|object(X1,X3)|~on(X1,X2,X3)|~time(X3)|~neq(X1,X2)|~a_block(X2)|~nonfixed(X1))).
% 85.97/11.20 cnf(i_0_21, plain, (~on(X1,X2,X3)|~on(X4,X2,X3)|~neq(X2,X1)|~neq(X4,X1)|~neq(X4,X2)|~nonfixed(X1)|~nonfixed(X2)|~nonfixed(X4))).
% 85.97/11.20 cnf(i_0_22, plain, (~on(X1,X2,X3)|~on(X1,X4,X3)|~neq(X4,X2)|~neq(X1,X2)|~neq(X1,X4)|~a_block(X2)|~a_block(X4)|~nonfixed(X1))).
% 85.97/11.20 cnf(i_0_11, plain, (on(X1,X2,X3)|object(X1,X3)|~on(X1,X2,s(X3))|~time(X3)|~neq(X1,X2)|~a_block(X2)|~nonfixed(X1))).
% 85.97/11.20 cnf(i_0_12, plain, (on(X1,X2,X3)|destination(X2,X3)|~on(X1,X2,s(X3))|~time(X3)|~neq(X1,X2)|~a_block(X2)|~nonfixed(X1))).
% 85.97/11.20 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 85.97/11.20 # Begin printing tableau
% 85.97/11.20 # Found 4 steps
% 85.97/11.20 cnf(i_0_38, hypothesis, (nonfixed(block_1)), inference(start_rule)).
% 85.97/11.20 cnf(i_0_21121, plain, (nonfixed(block_1)), inference(extension_rule, [i_0_16])).
% 85.97/11.20 cnf(i_0_117929, plain, (~source(block_1,time_0)), inference(extension_rule, [i_0_45])).
% 85.97/11.20 cnf(i_0_118038, plain, (~time(time_0)), inference(closure_rule, [i_0_41])).
% 85.97/11.20 # End printing tableau
% 85.97/11.20 # SZS output end
% 85.97/11.20 # Branches closed with saturation will be marked with an "s"
% 85.97/11.21 # Child (7471) has found a proof.
% 85.97/11.21
% 85.97/11.21 # Proof search is over...
% 85.97/11.21 # Freeing feature tree
%------------------------------------------------------------------------------