TSTP Solution File: PUZ062-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : PUZ062-2 : TPTP v8.1.0. Released v3.2.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 : n027.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 18:11:04 EDT 2022
% Result : Unsatisfiable 0.12s 0.38s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : PUZ062-2 : TPTP v8.1.0. Released v3.2.0.
% 0.10/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 : n027.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 : Sat May 28 23:04:14 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 13 Number of unprocessed: 13
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # 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 # 13 beginning clauses after preprocessing and clausification
% 0.12/0.38 # Creating start rules for all 6 conjectures.
% 0.12/0.38 # There are 6 start rule candidates:
% 0.12/0.38 # Found 8 unit axioms.
% 0.12/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.38 # 6 start rule tableaux created.
% 0.12/0.38 # 5 extension rule candidate clauses
% 0.12/0.38 # 8 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 6
% 0.12/0.38 # There were 2 total branch saturation attempts.
% 0.12/0.38 # There were 0 of these attempts blocked.
% 0.12/0.38 # There were 0 deferred branch saturation attempts.
% 0.12/0.38 # There were 0 free duplicated saturations.
% 0.12/0.38 # There were 2 total successful branch saturations.
% 0.12/0.38 # There were 0 successful branch saturations in interreduction.
% 0.12/0.38 # There were 0 successful branch saturations on the branch.
% 0.12/0.38 # There were 2 successful branch saturations after the branch.
% 0.12/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.38 # Begin clausification derivation
% 0.12/0.38
% 0.12/0.38 # End clausification derivation
% 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.38 cnf(i_0_23, negated_conjecture, (c_inter(v_a,v_t,tc_prod(tc_nat,tc_nat))=c_emptyset)).
% 0.12/0.38 cnf(i_0_21, negated_conjecture, (c_in(v_t,c_Mutil_Otiling(c_Mutil_Odomino,tc_prod(tc_nat,tc_nat)),tc_set(tc_prod(tc_nat,tc_nat))))).
% 0.12/0.38 cnf(i_0_24, negated_conjecture, (c_insert(c_Pair(v_i,v_j,tc_nat,tc_nat),c_emptyset,tc_prod(tc_nat,tc_nat))=c_inter(c_Mutil_Ocoloured(c_0),v_a,tc_prod(tc_nat,tc_nat)))).
% 0.12/0.38 cnf(i_0_25, negated_conjecture, (c_inter(c_Mutil_Ocoloured(c_Suc(c_0)),v_a,tc_prod(tc_nat,tc_nat))=c_insert(c_Pair(v_m,v_n,tc_nat,tc_nat),c_emptyset,tc_prod(tc_nat,tc_nat)))).
% 0.12/0.38 cnf(i_0_19, plain, (c_in(X1,c_insert(X1,X2,X3),X3))).
% 0.12/0.38 cnf(i_0_22, negated_conjecture, (c_Finite__Set_Ocard(c_inter(c_Mutil_Ocoloured(c_Suc(c_0)),v_t,tc_prod(tc_nat,tc_nat)),tc_prod(tc_nat,tc_nat))=c_Finite__Set_Ocard(c_inter(c_Mutil_Ocoloured(c_0),v_t,tc_prod(tc_nat,tc_nat)),tc_prod(tc_nat,tc_nat)))).
% 0.12/0.38 cnf(i_0_20, plain, (~c_in(X1,c_emptyset,X2))).
% 0.12/0.38 cnf(i_0_26, negated_conjecture, (c_Finite__Set_Ocard(c_insert(c_Pair(v_m,v_n,tc_nat,tc_nat),c_inter(c_Mutil_Ocoloured(c_Suc(c_0)),v_t,tc_prod(tc_nat,tc_nat)),tc_prod(tc_nat,tc_nat)),tc_prod(tc_nat,tc_nat))!=c_Finite__Set_Ocard(c_insert(c_Pair(v_i,v_j,tc_nat,tc_nat),c_inter(c_Mutil_Ocoloured(c_0),v_t,tc_prod(tc_nat,tc_nat)),tc_prod(tc_nat,tc_nat)),tc_prod(tc_nat,tc_nat)))).
% 0.12/0.38 cnf(i_0_17, plain, (c_in(X1,X2,X3)|~c_in(X1,c_inter(X4,X2,X3),X3))).
% 0.12/0.38 cnf(i_0_18, plain, (c_in(X1,c_inter(X2,X3,X4),X4)|~c_in(X1,X2,X4)|~c_in(X1,X3,X4))).
% 0.12/0.38 cnf(i_0_15, plain, (c_in(c_inter(X1,X2,X3),c_Finite__Set_OFinites,tc_set(X3))|~c_in(X2,c_Finite__Set_OFinites,tc_set(X3)))).
% 0.12/0.38 cnf(i_0_16, plain, (c_in(X1,c_Finite__Set_OFinites,tc_set(tc_prod(tc_nat,tc_nat)))|~c_in(X1,c_Mutil_Otiling(c_Mutil_Odomino,tc_prod(tc_nat,tc_nat)),tc_set(tc_prod(tc_nat,tc_nat))))).
% 0.12/0.38 cnf(i_0_14, plain, (c_Finite__Set_Ocard(c_insert(X1,X2,X3),X3)=c_Suc(c_Finite__Set_Ocard(X2,X3))|c_in(X1,X2,X3)|~c_in(X2,c_Finite__Set_OFinites,tc_set(X3)))).
% 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.38 # Begin printing tableau
% 0.12/0.38 # Found 5 steps
% 0.12/0.38 cnf(i_0_21, negated_conjecture, (c_in(v_t,c_Mutil_Otiling(c_Mutil_Odomino,tc_prod(tc_nat,tc_nat)),tc_set(tc_prod(tc_nat,tc_nat)))), inference(start_rule)).
% 0.12/0.38 cnf(i_0_31, plain, (c_in(v_t,c_Mutil_Otiling(c_Mutil_Odomino,tc_prod(tc_nat,tc_nat)),tc_set(tc_prod(tc_nat,tc_nat)))), inference(extension_rule, [i_0_16])).
% 0.12/0.38 cnf(i_0_88, plain, (c_in(v_t,c_Finite__Set_OFinites,tc_set(tc_prod(tc_nat,tc_nat)))), inference(extension_rule, [i_0_18])).
% 0.12/0.38 cnf(i_0_108, plain, (~c_in(v_t,c_insert(v_t,X2,tc_set(tc_prod(tc_nat,tc_nat))),tc_set(tc_prod(tc_nat,tc_nat)))), inference(closure_rule, [i_0_19])).
% 0.12/0.38 cnf(i_0_107, plain, (c_in(v_t,c_inter(c_insert(v_t,X2,tc_set(tc_prod(tc_nat,tc_nat))),c_Finite__Set_OFinites,tc_set(tc_prod(tc_nat,tc_nat))),tc_set(tc_prod(tc_nat,tc_nat)))), inference(etableau_closure_rule, [i_0_107, ...])).
% 0.12/0.38 # End printing tableau
% 0.12/0.38 # SZS output end
% 0.12/0.38 # Branches closed with saturation will be marked with an "s"
% 0.12/0.38 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.38 # We now have 4 tableaux to operate on
% 0.12/0.38 # Found closed tableau during pool population.
% 0.12/0.38 # Proof search is over...
% 0.12/0.38 # Freeing feature tree
%------------------------------------------------------------------------------