TSTP Solution File: REL029-10 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : REL029-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 : 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 19:21:15 EDT 2022
% Result : Unsatisfiable 14.72s 2.14s
% Output : CNFRefutation 14.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.07 % Problem : REL029-10 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.07 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.07/0.26 % Computer : n020.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 600
% 0.07/0.26 % DateTime : Fri Jul 8 10:47:58 EDT 2022
% 0.07/0.26 % CPUTime :
% 0.11/0.27 # No SInE strategy applied
% 0.11/0.27 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 0.11/0.27 # and selection function SelectNewComplexAHP.
% 0.11/0.27 #
% 0.11/0.27 # Presaturation interreduction done
% 0.11/0.27 # Number of axioms: 19 Number of unprocessed: 19
% 0.11/0.27 # Tableaux proof search.
% 0.11/0.27 # APR header successfully linked.
% 0.11/0.27 # Hello from C++
% 0.11/0.27 # The folding up rule is enabled...
% 0.11/0.27 # Local unification is enabled...
% 0.11/0.27 # Any saturation attempts will use folding labels...
% 0.11/0.27 # 19 beginning clauses after preprocessing and clausification
% 0.11/0.27 # Creating start rules for all 3 conjectures.
% 0.11/0.27 # There are 3 start rule candidates:
% 0.11/0.27 # Found 19 unit axioms.
% 0.11/0.27 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.11/0.27 # 3 start rule tableaux created.
% 0.11/0.27 # 0 extension rule candidate clauses
% 0.11/0.27 # 19 unit axiom clauses
% 0.11/0.27
% 0.11/0.27 # Requested 8, 32 cores available to the main process.
% 0.11/0.27 # There are not enough tableaux to fork, creating more from the initial 3
% 0.11/0.27 # Creating equality axioms
% 0.11/0.27 # Ran out of tableaux, making start rules for all clauses
% 0.11/0.27 # Returning from population with 30 new_tableaux and 0 remaining starting tableaux.
% 0.11/0.27 # We now have 30 tableaux to operate on
% 14.72/2.14 # There were 1 total branch saturation attempts.
% 14.72/2.14 # There were 0 of these attempts blocked.
% 14.72/2.14 # There were 0 deferred branch saturation attempts.
% 14.72/2.14 # There were 0 free duplicated saturations.
% 14.72/2.14 # There were 1 total successful branch saturations.
% 14.72/2.14 # There were 0 successful branch saturations in interreduction.
% 14.72/2.14 # There were 0 successful branch saturations on the branch.
% 14.72/2.14 # There were 1 successful branch saturations after the branch.
% 14.72/2.14 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.72/2.14 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.72/2.14 # Begin clausification derivation
% 14.72/2.14
% 14.72/2.14 # End clausification derivation
% 14.72/2.14 # Begin listing active clauses obtained from FOF to CNF conversion
% 14.72/2.14 cnf(i_0_27, plain, (converse(converse(X1))=X1)).
% 14.72/2.14 cnf(i_0_36, negated_conjecture, (join(sk1,one)=one)).
% 14.72/2.14 cnf(i_0_37, negated_conjecture, (join(sk2,one)=one)).
% 14.72/2.14 cnf(i_0_25, plain, (composition(X1,one)=X1)).
% 14.72/2.14 cnf(i_0_31, plain, (join(X1,complement(X1))=top)).
% 14.72/2.14 cnf(i_0_32, plain, (meet(X1,complement(X1))=zero)).
% 14.72/2.14 cnf(i_0_28, plain, (join(converse(X1),converse(X2))=converse(join(X1,X2)))).
% 14.72/2.14 cnf(i_0_21, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
% 14.72/2.14 cnf(i_0_24, plain, (composition(composition(X1,X2),X3)=composition(X1,composition(X2,X3)))).
% 14.72/2.14 cnf(i_0_29, plain, (composition(converse(X1),converse(X2))=converse(composition(X2,X1)))).
% 14.72/2.14 cnf(i_0_23, plain, (complement(join(complement(X1),complement(X2)))=meet(X1,X2))).
% 14.72/2.14 cnf(i_0_26, plain, (join(composition(X1,X2),composition(X3,X2))=composition(join(X1,X3),X2))).
% 14.72/2.14 cnf(i_0_30, plain, (join(complement(X1),composition(converse(X2),complement(composition(X2,X1))))=complement(X1))).
% 14.72/2.14 cnf(i_0_22, plain, (join(meet(X1,X2),complement(join(complement(X1),X2)))=X1)).
% 14.72/2.14 cnf(i_0_34, plain, (join(meet(composition(X1,X2),X3),meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3))=meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3))).
% 14.72/2.14 cnf(i_0_35, plain, (join(meet(composition(X1,X2),X3),meet(composition(meet(X1,composition(X3,converse(X2))),X2),X3))=meet(composition(meet(X1,composition(X3,converse(X2))),X2),X3))).
% 14.72/2.14 cnf(i_0_33, plain, (join(meet(composition(X1,X2),X3),composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3))))=composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3))))).
% 14.72/2.14 cnf(i_0_20, plain, (join(X1,X2)=join(X2,X1))).
% 14.72/2.14 cnf(i_0_38, negated_conjecture, (tuple(join(composition(meet(sk1,sk2),sk3),meet(composition(sk1,sk3),composition(sk2,sk3))),join(composition(meet(sk1,sk2),sk3),meet(composition(sk1,sk3),composition(sk2,sk3))))!=tuple(composition(meet(sk1,sk2),sk3),meet(composition(sk1,sk3),composition(sk2,sk3))))).
% 14.72/2.14 cnf(i_0_42, plain, (X4=X4)).
% 14.72/2.14 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 14.72/2.14 # Begin printing tableau
% 14.72/2.14 # Found 6 steps
% 14.72/2.14 cnf(i_0_27, plain, (converse(converse(X5))=X5), inference(start_rule)).
% 14.72/2.14 cnf(i_0_52, plain, (converse(converse(X5))=X5), inference(extension_rule, [i_0_51])).
% 14.72/2.14 cnf(i_0_93, plain, (converse(converse(X3))!=X3), inference(closure_rule, [i_0_27])).
% 14.72/2.14 cnf(i_0_92, plain, (tuple(converse(converse(X3)),converse(converse(X5)))=tuple(X3,X5)), inference(extension_rule, [i_0_45])).
% 14.72/2.14 cnf(i_0_101, plain, (tuple(X3,X5)!=converse(converse(tuple(X3,X5)))), inference(closure_rule, [i_0_27])).
% 14.72/2.14 cnf(i_0_99, plain, (tuple(converse(converse(X3)),converse(converse(X5)))=converse(converse(tuple(X3,X5)))), inference(etableau_closure_rule, [i_0_99, ...])).
% 14.72/2.14 # End printing tableau
% 14.72/2.14 # SZS output end
% 14.72/2.14 # Branches closed with saturation will be marked with an "s"
% 14.72/2.16 # Child (7931) has found a proof.
% 14.72/2.16
% 14.72/2.16 # Proof search is over...
% 14.72/2.16 # Freeing feature tree
%------------------------------------------------------------------------------