TSTP Solution File: PLA005-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : PLA005-2 : TPTP v8.1.0. Released v1.1.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 : 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 : Mon Jul 18 16:56:38 EDT 2022
% Result : Unsatisfiable 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : PLA005-2 : TPTP v8.1.0. Released v1.1.0.
% 0.10/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.32 % Computer : n020.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Tue May 31 18:21:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 # No SInE strategy applied
% 0.12/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.35 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.35 #
% 0.12/0.35 # Presaturation interreduction done
% 0.12/0.35 # Number of axioms: 31 Number of unprocessed: 31
% 0.12/0.35 # Tableaux proof search.
% 0.12/0.35 # APR header successfully linked.
% 0.12/0.35 # 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 # 31 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 20 unit axioms.
% 0.12/0.36 # 1 start rule tableaux created.
% 0.12/0.36 # 11 extension rule candidate clauses
% 0.12/0.36 # 20 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.37 # There were 2 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 2 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 2 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_43, plain, (differ(a,b))).
% 0.12/0.37 cnf(i_0_44, plain, (differ(a,c))).
% 0.12/0.37 cnf(i_0_45, plain, (differ(a,d))).
% 0.12/0.37 cnf(i_0_47, plain, (differ(b,c))).
% 0.12/0.37 cnf(i_0_60, plain, (holds(empty,s0))).
% 0.12/0.37 cnf(i_0_48, plain, (differ(b,d))).
% 0.12/0.37 cnf(i_0_46, plain, (differ(a,table))).
% 0.12/0.37 cnf(i_0_49, plain, (differ(b,table))).
% 0.12/0.37 cnf(i_0_51, plain, (differ(c,table))).
% 0.12/0.37 cnf(i_0_50, plain, (differ(c,d))).
% 0.12/0.37 cnf(i_0_52, plain, (differ(d,table))).
% 0.12/0.37 cnf(i_0_55, plain, (holds(on(c,d),s0))).
% 0.12/0.37 cnf(i_0_57, plain, (holds(clear(a),s0))).
% 0.12/0.37 cnf(i_0_58, plain, (holds(clear(b),s0))).
% 0.12/0.37 cnf(i_0_59, plain, (holds(clear(c),s0))).
% 0.12/0.37 cnf(i_0_61, plain, (holds(clear(table),X1))).
% 0.12/0.37 cnf(i_0_53, plain, (holds(on(a,table),s0))).
% 0.12/0.37 cnf(i_0_54, plain, (holds(on(b,table),s0))).
% 0.12/0.37 cnf(i_0_56, plain, (holds(on(d,table),s0))).
% 0.12/0.37 cnf(i_0_62, negated_conjecture, (~holds(and(on(d,b),on(c,a)),X1))).
% 0.12/0.37 cnf(i_0_42, plain, (differ(X1,X2)|~differ(X2,X1))).
% 0.12/0.37 cnf(i_0_32, plain, (holds(and(X1,X2),X3)|~holds(X2,X3)|~holds(X1,X3))).
% 0.12/0.37 cnf(i_0_40, plain, (holds(on(X1,X2),do(putdown(X3,X4),X5))|~holds(on(X1,X2),X5))).
% 0.12/0.37 cnf(i_0_36, plain, (holds(clear(X1),do(pickup(X2),X3))|~differ(X1,X2)|~holds(clear(X1),X3))).
% 0.12/0.37 cnf(i_0_37, plain, (holds(empty,do(putdown(X1,X2),X3))|~holds(holding(X1),X3)|~holds(clear(X2),X3))).
% 0.12/0.37 cnf(i_0_35, plain, (holds(on(X1,X2),do(pickup(X3),X4))|~differ(X1,X3)|~holds(on(X1,X2),X4))).
% 0.12/0.37 cnf(i_0_33, plain, (holds(holding(X1),do(pickup(X1),X2))|~differ(X1,table)|~holds(clear(X1),X2)|~holds(empty,X2))).
% 0.12/0.37 cnf(i_0_41, plain, (holds(clear(X1),do(putdown(X2,X3),X4))|~differ(X1,X3)|~holds(clear(X1),X4))).
% 0.12/0.37 cnf(i_0_39, plain, (holds(clear(X1),do(putdown(X1,X2),X3))|~holds(holding(X1),X3)|~holds(clear(X2),X3))).
% 0.12/0.37 cnf(i_0_34, plain, (holds(clear(X1),do(pickup(X2),X3))|~holds(on(X2,X1),X3)|~holds(clear(X2),X3)|~holds(empty,X3))).
% 0.12/0.37 cnf(i_0_38, plain, (holds(on(X1,X2),do(putdown(X1,X2),X3))|~holds(holding(X1),X3)|~holds(clear(X2),X3))).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 6 steps
% 0.12/0.37 cnf(i_0_62, negated_conjecture, (~holds(and(on(d,b),on(c,a)),do(putdown(c,a),s0))), inference(start_rule)).
% 0.12/0.37 cnf(i_0_63, plain, (~holds(and(on(d,b),on(c,a)),do(putdown(c,a),s0))), inference(extension_rule, [i_0_32])).
% 0.12/0.37 cnf(i_0_67, plain, (~holds(on(c,a),do(putdown(c,a),s0))), inference(extension_rule, [i_0_38])).
% 0.12/0.37 cnf(i_0_129, plain, (~holds(clear(a),s0)), inference(closure_rule, [i_0_57])).
% 0.12/0.37 cnf(i_0_68, plain, (~holds(on(d,b),do(putdown(c,a),s0))), inference(etableau_closure_rule, [i_0_68, ...])).
% 0.12/0.37 cnf(i_0_128, plain, (~holds(holding(c),s0)), inference(etableau_closure_rule, [i_0_128, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 3 tableaux to operate on
% 0.12/0.37 # Found closed tableau during pool population.
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------