TSTP Solution File: PLA017-10 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : PLA017-10 : TPTP v8.1.0. Released v7.3.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 : n028.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:40 EDT 2022
% Result : Unsatisfiable 2.23s 0.63s
% Output : CNFRefutation 2.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PLA017-10 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue May 31 22:55:36 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 32 Number of unprocessed: 32
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 32 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 1 conjectures.
% 0.12/0.36 # There are 1 start rule candidates:
% 0.12/0.36 # Found 32 unit axioms.
% 0.12/0.36 # 1 start rule tableaux created.
% 0.12/0.36 # 0 extension rule candidate clauses
% 0.12/0.36 # 32 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.36 # Creating equality axioms
% 0.12/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.36 # Returning from population with 53 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 53 tableaux to operate on
% 2.23/0.63 # There were 1 total branch saturation attempts.
% 2.23/0.63 # There were 0 of these attempts blocked.
% 2.23/0.63 # There were 0 deferred branch saturation attempts.
% 2.23/0.63 # There were 0 free duplicated saturations.
% 2.23/0.63 # There were 1 total successful branch saturations.
% 2.23/0.63 # There were 0 successful branch saturations in interreduction.
% 2.23/0.63 # There were 0 successful branch saturations on the branch.
% 2.23/0.63 # There were 1 successful branch saturations after the branch.
% 2.23/0.63 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.23/0.63 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.23/0.63 # Begin clausification derivation
% 2.23/0.63
% 2.23/0.63 # End clausification derivation
% 2.23/0.63 # Begin listing active clauses obtained from FOF to CNF conversion
% 2.23/0.63 cnf(i_0_46, plain, (differ(a,c)=true)).
% 2.23/0.63 cnf(i_0_62, plain, (holds(empty,s0)=true)).
% 2.23/0.63 cnf(i_0_48, plain, (differ(a,table)=true)).
% 2.23/0.63 cnf(i_0_45, plain, (differ(a,b)=true)).
% 2.23/0.63 cnf(i_0_47, plain, (differ(a,d)=true)).
% 2.23/0.63 cnf(i_0_49, plain, (differ(b,c)=true)).
% 2.23/0.63 cnf(i_0_51, plain, (differ(b,table)=true)).
% 2.23/0.63 cnf(i_0_50, plain, (differ(b,d)=true)).
% 2.23/0.63 cnf(i_0_53, plain, (differ(c,table)=true)).
% 2.23/0.63 cnf(i_0_52, plain, (differ(c,d)=true)).
% 2.23/0.63 cnf(i_0_54, plain, (differ(d,table)=true)).
% 2.23/0.63 cnf(i_0_59, plain, (holds(clear(a),s0)=true)).
% 2.23/0.63 cnf(i_0_61, plain, (holds(clear(c),s0)=true)).
% 2.23/0.63 cnf(i_0_55, plain, (holds(on(a,table),s0)=true)).
% 2.23/0.63 cnf(i_0_57, plain, (holds(on(c,d),s0)=true)).
% 2.23/0.63 cnf(i_0_60, plain, (holds(clear(b),s0)=true)).
% 2.23/0.63 cnf(i_0_63, plain, (holds(clear(table),X1)=true)).
% 2.23/0.63 cnf(i_0_33, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 2.23/0.63 cnf(i_0_56, plain, (holds(on(b,table),s0)=true)).
% 2.23/0.63 cnf(i_0_58, plain, (holds(on(d,table),s0)=true)).
% 2.23/0.63 cnf(i_0_44, plain, (ifeq(differ(X1,X2),true,differ(X2,X1),true)=true)).
% 2.23/0.63 cnf(i_0_34, plain, (ifeq(holds(X1,X2),true,ifeq(holds(X3,X2),true,holds(and(X3,X1),X2),true),true)=true)).
% 2.23/0.63 cnf(i_0_42, plain, (ifeq(holds(on(X1,X2),X3),true,holds(on(X1,X2),do(putdown(X4,X5),X3)),true)=true)).
% 2.23/0.63 cnf(i_0_38, plain, (ifeq(differ(X1,X2),true,ifeq(holds(clear(X1),X3),true,holds(clear(X1),do(pickup(X2),X3)),true),true)=true)).
% 2.23/0.63 cnf(i_0_39, plain, (ifeq(holds(holding(X1),X2),true,ifeq(holds(clear(X3),X2),true,holds(empty,do(putdown(X1,X3),X2)),true),true)=true)).
% 2.23/0.63 cnf(i_0_37, plain, (ifeq(differ(X1,X2),true,ifeq(holds(on(X1,X3),X4),true,holds(on(X1,X3),do(pickup(X2),X4)),true),true)=true)).
% 2.23/0.63 cnf(i_0_43, plain, (ifeq(differ(X1,X2),true,ifeq(holds(clear(X1),X3),true,holds(clear(X1),do(putdown(X4,X2),X3)),true),true)=true)).
% 2.23/0.63 cnf(i_0_41, plain, (ifeq(holds(holding(X1),X2),true,ifeq(holds(clear(X3),X2),true,holds(clear(X1),do(putdown(X1,X3),X2)),true),true)=true)).
% 2.23/0.63 cnf(i_0_40, plain, (ifeq(holds(holding(X1),X2),true,ifeq(holds(clear(X3),X2),true,holds(on(X1,X3),do(putdown(X1,X3),X2)),true),true)=true)).
% 2.23/0.63 cnf(i_0_35, plain, (ifeq(differ(X1,table),true,ifeq(holds(empty,X2),true,ifeq(holds(clear(X1),X2),true,holds(holding(X1),do(pickup(X1),X2)),true),true),true)=true)).
% 2.23/0.63 cnf(i_0_36, plain, (ifeq(holds(on(X1,X2),X3),true,ifeq(holds(empty,X3),true,ifeq(holds(clear(X1),X3),true,holds(clear(X2),do(pickup(X1),X3)),true),true),true)=true)).
% 2.23/0.63 cnf(i_0_64, negated_conjecture, (holds(on(a,c),X1)!=true)).
% 2.23/0.63 cnf(i_0_66, plain, (X6=X6)).
% 2.23/0.63 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 2.23/0.63 # Begin printing tableau
% 2.23/0.63 # Found 7 steps
% 2.23/0.63 cnf(i_0_46, plain, (differ(a,c)=true), inference(start_rule)).
% 2.23/0.63 cnf(i_0_80, plain, (differ(a,c)=true), inference(extension_rule, [i_0_76])).
% 2.23/0.63 cnf(i_0_138, plain, (pickup(differ(a,c))=pickup(true)), inference(extension_rule, [i_0_70])).
% 2.23/0.63 cnf(i_0_286, plain, (differ(a,c)!=true), inference(closure_rule, [i_0_46])).
% 2.23/0.63 cnf(i_0_287, plain, (differ(a,c)!=true), inference(closure_rule, [i_0_46])).
% 2.23/0.63 cnf(i_0_288, plain, (differ(a,c)!=true), inference(closure_rule, [i_0_46])).
% 2.23/0.63 cnf(i_0_284, plain, (ifeq(pickup(differ(a,c)),differ(a,c),differ(a,c),differ(a,c))=ifeq(pickup(true),true,true,true)), inference(etableau_closure_rule, [i_0_284, ...])).
% 2.23/0.63 # End printing tableau
% 2.23/0.63 # SZS output end
% 2.23/0.63 # Branches closed with saturation will be marked with an "s"
% 2.23/0.64 # Child (16146) has found a proof.
% 2.23/0.64
% 2.23/0.64 # Proof search is over...
% 2.23/0.64 # Freeing feature tree
%------------------------------------------------------------------------------